java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 10:39:11,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 10:39:11,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 10:39:11,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 10:39:11,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 10:39:11,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 10:39:11,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 10:39:11,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 10:39:11,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 10:39:11,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 10:39:11,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 10:39:11,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 10:39:11,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 10:39:11,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 10:39:11,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 10:39:11,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 10:39:11,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 10:39:11,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 10:39:11,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 10:39:11,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 10:39:11,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 10:39:11,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 10:39:11,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 10:39:11,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 10:39:11,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 10:39:11,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 10:39:11,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 10:39:11,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 10:39:11,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 10:39:11,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 10:39:11,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 10:39:11,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 10:39:11,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 10:39:11,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 10:39:11,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 10:39:11,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 10:39:11,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 10:39:11,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 10:39:11,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 10:39:11,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 10:39:11,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 10:39:11,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 10:39:11,765 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 10:39:11,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 10:39:11,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 10:39:11,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 10:39:11,770 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 10:39:11,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 10:39:11,771 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 10:39:11,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 10:39:11,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 10:39:11,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 10:39:11,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 10:39:11,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 10:39:11,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 10:39:11,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 10:39:11,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 10:39:11,774 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 10:39:11,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 10:39:11,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 10:39:11,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 10:39:11,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 10:39:11,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 10:39:11,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:39:11,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 10:39:11,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 10:39:11,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 10:39:11,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 10:39:11,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 10:39:11,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 10:39:11,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 10:39:11,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 10:39:11,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 10:39:11,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 10:39:11,833 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 10:39:11,834 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 10:39:11,835 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.i [2019-10-02 10:39:11,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19c3f71a/f3f640dbeb834cf283fa432258f80319/FLAG51983cc02 [2019-10-02 10:39:12,478 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 10:39:12,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.i [2019-10-02 10:39:12,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19c3f71a/f3f640dbeb834cf283fa432258f80319/FLAG51983cc02 [2019-10-02 10:39:12,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19c3f71a/f3f640dbeb834cf283fa432258f80319 [2019-10-02 10:39:12,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 10:39:12,796 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 10:39:12,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 10:39:12,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 10:39:12,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 10:39:12,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:39:12" (1/1) ... [2019-10-02 10:39:12,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64802a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:39:12, skipping insertion in model container [2019-10-02 10:39:12,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:39:12" (1/1) ... [2019-10-02 10:39:12,814 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 10:39:12,866 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 10:39:13,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:39:13,339 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 10:39:13,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:39:13,487 INFO L192 MainTranslator]: Completed translation [2019-10-02 10:39:13,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:39:13 WrapperNode [2019-10-02 10:39:13,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 10:39:13,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 10:39:13,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 10:39:13,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 10:39:13,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:39:13" (1/1) ... [2019-10-02 10:39:13,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:39:13" (1/1) ... [2019-10-02 10:39:13,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:39:13" (1/1) ... [2019-10-02 10:39:13,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:39:13" (1/1) ... [2019-10-02 10:39:13,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:39:13" (1/1) ... [2019-10-02 10:39:13,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:39:13" (1/1) ... [2019-10-02 10:39:13,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:39:13" (1/1) ... [2019-10-02 10:39:13,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 10:39:13,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 10:39:13,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 10:39:13,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 10:39:13,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:39:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:39:13,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 10:39:13,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 10:39:13,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 10:39:13,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 10:39:13,616 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-02 10:39:13,616 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-10-02 10:39:13,616 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2019-10-02 10:39:13,617 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-10-02 10:39:13,617 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2019-10-02 10:39:13,617 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2019-10-02 10:39:13,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 10:39:13,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 10:39:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 10:39:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 10:39:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 10:39:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 10:39:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 10:39:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 10:39:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 10:39:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 10:39:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 10:39:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 10:39:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 10:39:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 10:39:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 10:39:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 10:39:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 10:39:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 10:39:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 10:39:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 10:39:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 10:39:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 10:39:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 10:39:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 10:39:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 10:39:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 10:39:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 10:39:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 10:39:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 10:39:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 10:39:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 10:39:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 10:39:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 10:39:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 10:39:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 10:39:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 10:39:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 10:39:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 10:39:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 10:39:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 10:39:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 10:39:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 10:39:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 10:39:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 10:39:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 10:39:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 10:39:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 10:39:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 10:39:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 10:39:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 10:39:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 10:39:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 10:39:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 10:39:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 10:39:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 10:39:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 10:39:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 10:39:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 10:39:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 10:39:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 10:39:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 10:39:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 10:39:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 10:39:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 10:39:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 10:39:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 10:39:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 10:39:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 10:39:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 10:39:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 10:39:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 10:39:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 10:39:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 10:39:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 10:39:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 10:39:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 10:39:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 10:39:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 10:39:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 10:39:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 10:39:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 10:39:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 10:39:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 10:39:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 10:39:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 10:39:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 10:39:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 10:39:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 10:39:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 10:39:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 10:39:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 10:39:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 10:39:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 10:39:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 10:39:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 10:39:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 10:39:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 10:39:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 10:39:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 10:39:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 10:39:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 10:39:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 10:39:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 10:39:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 10:39:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 10:39:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 10:39:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 10:39:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 10:39:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-02 10:39:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-10-02 10:39:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 10:39:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 10:39:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2019-10-02 10:39:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 10:39:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-10-02 10:39:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 10:39:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2019-10-02 10:39:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2019-10-02 10:39:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 10:39:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 10:39:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 10:39:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 10:39:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 10:39:13,927 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-02 10:39:14,186 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 10:39:14,186 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-02 10:39:14,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:39:14 BoogieIcfgContainer [2019-10-02 10:39:14,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 10:39:14,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 10:39:14,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 10:39:14,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 10:39:14,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:39:12" (1/3) ... [2019-10-02 10:39:14,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b91650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:39:14, skipping insertion in model container [2019-10-02 10:39:14,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:39:13" (2/3) ... [2019-10-02 10:39:14,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b91650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:39:14, skipping insertion in model container [2019-10-02 10:39:14,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:39:14" (3/3) ... [2019-10-02 10:39:14,197 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-2.i [2019-10-02 10:39:14,207 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 10:39:14,216 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 10:39:14,234 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 10:39:14,266 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 10:39:14,267 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 10:39:14,267 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 10:39:14,267 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 10:39:14,268 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 10:39:14,268 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 10:39:14,268 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 10:39:14,268 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 10:39:14,268 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 10:39:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-10-02 10:39:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 10:39:14,294 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:14,295 INFO L411 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] [2019-10-02 10:39:14,297 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:14,302 INFO L82 PathProgramCache]: Analyzing trace with hash -87837704, now seen corresponding path program 1 times [2019-10-02 10:39:14,304 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:14,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:14,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:14,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:14,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:39:14,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:14,471 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:14,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:14,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 10:39:14,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:39:14,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:39:14,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2019-10-02 10:39:14,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 10:39:14,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 10:39:14,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:39:14,787 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-10-02 10:39:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:14,825 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2019-10-02 10:39:14,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 10:39:14,827 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2019-10-02 10:39:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:14,844 INFO L225 Difference]: With dead ends: 124 [2019-10-02 10:39:14,844 INFO L226 Difference]: Without dead ends: 51 [2019-10-02 10:39:14,857 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:39:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-02 10:39:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-02 10:39:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-02 10:39:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-10-02 10:39:14,914 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 37 [2019-10-02 10:39:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:14,914 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-10-02 10:39:14,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 10:39:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-10-02 10:39:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 10:39:14,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:14,917 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:39:14,918 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:14,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1536900415, now seen corresponding path program 1 times [2019-10-02 10:39:14,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:14,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:14,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:14,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:14,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:39:15,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:15,122 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:15,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:15,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 10:39:15,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:39:15,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:39:15,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2019-10-02 10:39:15,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 10:39:15,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 10:39:15,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 10:39:15,286 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 9 states. [2019-10-02 10:39:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:15,486 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2019-10-02 10:39:15,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 10:39:15,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-10-02 10:39:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:15,490 INFO L225 Difference]: With dead ends: 91 [2019-10-02 10:39:15,490 INFO L226 Difference]: Without dead ends: 53 [2019-10-02 10:39:15,492 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 10:39:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-02 10:39:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-02 10:39:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 10:39:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-10-02 10:39:15,514 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 42 [2019-10-02 10:39:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:15,520 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-10-02 10:39:15,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 10:39:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-10-02 10:39:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 10:39:15,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:15,525 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:39:15,525 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:15,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:15,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1663200358, now seen corresponding path program 1 times [2019-10-02 10:39:15,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:15,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:15,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:15,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:15,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 10:39:15,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:39:15,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 10:39:15,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 10:39:15,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 10:39:15,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 10:39:15,729 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 10 states. [2019-10-02 10:39:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:15,945 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-10-02 10:39:15,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 10:39:15,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-10-02 10:39:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:15,956 INFO L225 Difference]: With dead ends: 73 [2019-10-02 10:39:15,956 INFO L226 Difference]: Without dead ends: 69 [2019-10-02 10:39:15,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-10-02 10:39:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-02 10:39:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-10-02 10:39:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-02 10:39:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2019-10-02 10:39:15,984 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 46 [2019-10-02 10:39:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:15,987 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2019-10-02 10:39:15,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 10:39:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2019-10-02 10:39:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 10:39:15,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:15,991 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:39:15,991 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:15,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:15,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1968577046, now seen corresponding path program 1 times [2019-10-02 10:39:15,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:15,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:16,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:16,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:16,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:39:16,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:16,404 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:16,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:16,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 10:39:16,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:16,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:39:16,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:16,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 15 [2019-10-02 10:39:16,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 10:39:16,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 10:39:16,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-10-02 10:39:16,579 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 15 states. [2019-10-02 10:39:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:16,996 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions. [2019-10-02 10:39:16,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 10:39:16,998 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-10-02 10:39:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:16,999 INFO L225 Difference]: With dead ends: 122 [2019-10-02 10:39:17,000 INFO L226 Difference]: Without dead ends: 77 [2019-10-02 10:39:17,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-10-02 10:39:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-02 10:39:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2019-10-02 10:39:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-02 10:39:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-10-02 10:39:17,013 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 47 [2019-10-02 10:39:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:17,014 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-10-02 10:39:17,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 10:39:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-10-02 10:39:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 10:39:17,016 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:17,016 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:39:17,016 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:17,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1781197021, now seen corresponding path program 2 times [2019-10-02 10:39:17,017 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:17,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:17,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 10:39:17,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:17,254 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:17,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:39:17,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:39:17,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:39:17,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 10:39:17,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:17,453 INFO L375 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 [2019-10-02 10:39:17,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:17,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:17,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:17,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-10-02 10:39:19,304 INFO L375 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 16 [2019-10-02 10:39:19,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:19,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:19,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:39:19,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2019-10-02 10:39:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:39:19,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:19,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 18 [2019-10-02 10:39:19,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 10:39:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 10:39:19,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-02 10:39:19,709 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 18 states. [2019-10-02 10:39:24,461 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2019-10-02 10:39:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:30,900 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2019-10-02 10:39:30,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 10:39:30,902 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2019-10-02 10:39:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:30,903 INFO L225 Difference]: With dead ends: 121 [2019-10-02 10:39:30,903 INFO L226 Difference]: Without dead ends: 111 [2019-10-02 10:39:30,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-10-02 10:39:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-02 10:39:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2019-10-02 10:39:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-02 10:39:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2019-10-02 10:39:30,920 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 51 [2019-10-02 10:39:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:30,920 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2019-10-02 10:39:30,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 10:39:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2019-10-02 10:39:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 10:39:30,922 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:30,922 INFO L411 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:39:30,923 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:30,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:30,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1370713395, now seen corresponding path program 3 times [2019-10-02 10:39:30,923 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:30,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:30,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:30,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:39:30,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 10:39:31,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:31,164 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:31,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:39:31,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 10:39:31,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:39:31,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 10:39:31,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 10:39:31,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:31,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-02 10:39:31,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 10:39:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 10:39:31,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 10:39:31,389 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 14 states. [2019-10-02 10:39:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:31,705 INFO L93 Difference]: Finished difference Result 157 states and 213 transitions. [2019-10-02 10:39:31,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 10:39:31,706 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-10-02 10:39:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:31,708 INFO L225 Difference]: With dead ends: 157 [2019-10-02 10:39:31,708 INFO L226 Difference]: Without dead ends: 153 [2019-10-02 10:39:31,709 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-02 10:39:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-02 10:39:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2019-10-02 10:39:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-02 10:39:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 167 transitions. [2019-10-02 10:39:31,739 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 167 transitions. Word has length 52 [2019-10-02 10:39:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:31,740 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 167 transitions. [2019-10-02 10:39:31,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 10:39:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 167 transitions. [2019-10-02 10:39:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 10:39:31,742 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:31,742 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:39:31,742 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:31,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:31,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1530622877, now seen corresponding path program 4 times [2019-10-02 10:39:31,743 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:31,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:31,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:39:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 10:39:32,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:32,077 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:32,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:39:32,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:39:32,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:39:32,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-02 10:39:32,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:32,200 INFO L375 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 [2019-10-02 10:39:32,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:32,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:32,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:32,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-02 10:39:32,216 INFO L375 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 [2019-10-02 10:39:32,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:32,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:32,229 INFO L375 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 [2019-10-02 10:39:32,229 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:32,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:32,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:32,237 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-10-02 10:39:32,252 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:32,253 INFO L375 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 15 [2019-10-02 10:39:32,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:32,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:32,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:32,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2019-10-02 10:39:32,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:39:32,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:32,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:32,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:39:32,338 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:32,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:32,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:32,350 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2019-10-02 10:39:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:39:34,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:34,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2019-10-02 10:39:34,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 10:39:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 10:39:34,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-10-02 10:39:34,039 INFO L87 Difference]: Start difference. First operand 127 states and 167 transitions. Second operand 26 states. [2019-10-02 10:39:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:35,317 INFO L93 Difference]: Finished difference Result 205 states and 268 transitions. [2019-10-02 10:39:35,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 10:39:35,321 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 53 [2019-10-02 10:39:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:35,326 INFO L225 Difference]: With dead ends: 205 [2019-10-02 10:39:35,326 INFO L226 Difference]: Without dead ends: 195 [2019-10-02 10:39:35,329 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2019-10-02 10:39:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-02 10:39:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-10-02 10:39:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-02 10:39:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 229 transitions. [2019-10-02 10:39:35,388 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 229 transitions. Word has length 53 [2019-10-02 10:39:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:35,389 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 229 transitions. [2019-10-02 10:39:35,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 10:39:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2019-10-02 10:39:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 10:39:35,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:35,397 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:39:35,398 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:35,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:35,398 INFO L82 PathProgramCache]: Analyzing trace with hash -407513290, now seen corresponding path program 1 times [2019-10-02 10:39:35,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:35,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:35,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:35,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:39:35,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 10:39:35,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:35,627 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:35,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:35,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 10:39:35,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 10:39:35,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:35,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-10-02 10:39:35,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 10:39:35,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 10:39:35,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-02 10:39:35,838 INFO L87 Difference]: Start difference. First operand 173 states and 229 transitions. Second operand 14 states. [2019-10-02 10:39:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:36,238 INFO L93 Difference]: Finished difference Result 328 states and 444 transitions. [2019-10-02 10:39:36,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 10:39:36,238 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-10-02 10:39:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:36,242 INFO L225 Difference]: With dead ends: 328 [2019-10-02 10:39:36,242 INFO L226 Difference]: Without dead ends: 218 [2019-10-02 10:39:36,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-10-02 10:39:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-02 10:39:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2019-10-02 10:39:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-02 10:39:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 256 transitions. [2019-10-02 10:39:36,270 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 256 transitions. Word has length 55 [2019-10-02 10:39:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:36,270 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 256 transitions. [2019-10-02 10:39:36,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 10:39:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 256 transitions. [2019-10-02 10:39:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 10:39:36,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:36,272 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:39:36,272 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:36,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2096457032, now seen corresponding path program 1 times [2019-10-02 10:39:36,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:36,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:36,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:36,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:36,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 10:39:36,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:36,386 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:36,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:36,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 10:39:36,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 10:39:36,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:39:36,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2019-10-02 10:39:36,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 10:39:36,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 10:39:36,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 10:39:36,554 INFO L87 Difference]: Start difference. First operand 190 states and 256 transitions. Second operand 11 states. [2019-10-02 10:39:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:36,806 INFO L93 Difference]: Finished difference Result 233 states and 315 transitions. [2019-10-02 10:39:36,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 10:39:36,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-10-02 10:39:36,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:36,809 INFO L225 Difference]: With dead ends: 233 [2019-10-02 10:39:36,809 INFO L226 Difference]: Without dead ends: 207 [2019-10-02 10:39:36,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-02 10:39:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-02 10:39:36,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2019-10-02 10:39:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-02 10:39:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2019-10-02 10:39:36,833 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 55 [2019-10-02 10:39:36,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:36,833 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2019-10-02 10:39:36,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 10:39:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2019-10-02 10:39:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 10:39:36,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:36,835 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:39:36,835 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:36,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:36,836 INFO L82 PathProgramCache]: Analyzing trace with hash -936081888, now seen corresponding path program 2 times [2019-10-02 10:39:36,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:36,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:36,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:36,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:36,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 10:39:36,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:36,962 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:37,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:39:37,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:39:37,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:39:37,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 10:39:37,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:39:37,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:37,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-10-02 10:39:37,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 10:39:37,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 10:39:37,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 10:39:37,095 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand 12 states. [2019-10-02 10:39:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:37,309 INFO L93 Difference]: Finished difference Result 289 states and 388 transitions. [2019-10-02 10:39:37,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 10:39:37,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-10-02 10:39:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:37,312 INFO L225 Difference]: With dead ends: 289 [2019-10-02 10:39:37,312 INFO L226 Difference]: Without dead ends: 199 [2019-10-02 10:39:37,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-10-02 10:39:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-02 10:39:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 177. [2019-10-02 10:39:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-02 10:39:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 236 transitions. [2019-10-02 10:39:37,330 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 236 transitions. Word has length 55 [2019-10-02 10:39:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:37,330 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 236 transitions. [2019-10-02 10:39:37,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 10:39:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 236 transitions. [2019-10-02 10:39:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 10:39:37,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:37,332 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:39:37,332 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:37,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1011494620, now seen corresponding path program 5 times [2019-10-02 10:39:37,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:37,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:37,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:37,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:39:37,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 10:39:37,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:37,431 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:37,506 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 10:39:37,552 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 10:39:37,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:39:37,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 10:39:37,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 10:39:37,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:37,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-10-02 10:39:37,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 10:39:37,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 10:39:37,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-02 10:39:37,572 INFO L87 Difference]: Start difference. First operand 177 states and 236 transitions. Second operand 11 states. [2019-10-02 10:39:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:37,776 INFO L93 Difference]: Finished difference Result 291 states and 386 transitions. [2019-10-02 10:39:37,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 10:39:37,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-10-02 10:39:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:37,779 INFO L225 Difference]: With dead ends: 291 [2019-10-02 10:39:37,779 INFO L226 Difference]: Without dead ends: 189 [2019-10-02 10:39:37,780 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-10-02 10:39:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-02 10:39:37,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 159. [2019-10-02 10:39:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-02 10:39:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 204 transitions. [2019-10-02 10:39:37,799 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 204 transitions. Word has length 57 [2019-10-02 10:39:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:37,799 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 204 transitions. [2019-10-02 10:39:37,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 10:39:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 204 transitions. [2019-10-02 10:39:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 10:39:37,801 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:37,801 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2019-10-02 10:39:37,801 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash 402935559, now seen corresponding path program 3 times [2019-10-02 10:39:37,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:37,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:37,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:37,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:39:37,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 10:39:38,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:38,110 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:38,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:39:38,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-02 10:39:38,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:39:38,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-02 10:39:38,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:38,277 INFO L375 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 [2019-10-02 10:39:38,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:38,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:38,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:38,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-10-02 10:39:38,318 INFO L375 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 [2019-10-02 10:39:38,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:38,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:38,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:38,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-02 10:39:38,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:38,363 INFO L375 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 15 [2019-10-02 10:39:38,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:38,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:38,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:38,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2019-10-02 10:39:38,404 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_24|], 1=[|v_#memory_$Pointer$.base_26|]} [2019-10-02 10:39:38,408 INFO L375 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 [2019-10-02 10:39:38,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:38,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:38,435 INFO L375 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 20 treesize of output 19 [2019-10-02 10:39:38,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:38,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:38,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:38,445 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-10-02 10:39:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:39:39,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:39,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2019-10-02 10:39:39,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 10:39:39,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 10:39:39,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-10-02 10:39:39,019 INFO L87 Difference]: Start difference. First operand 159 states and 204 transitions. Second operand 29 states. [2019-10-02 10:39:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:40,416 INFO L93 Difference]: Finished difference Result 195 states and 244 transitions. [2019-10-02 10:39:40,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 10:39:40,417 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 59 [2019-10-02 10:39:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:40,418 INFO L225 Difference]: With dead ends: 195 [2019-10-02 10:39:40,418 INFO L226 Difference]: Without dead ends: 188 [2019-10-02 10:39:40,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=238, Invalid=1568, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 10:39:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-02 10:39:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 160. [2019-10-02 10:39:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-02 10:39:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2019-10-02 10:39:40,433 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 59 [2019-10-02 10:39:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:40,433 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2019-10-02 10:39:40,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 10:39:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2019-10-02 10:39:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 10:39:40,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:40,435 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 10:39:40,435 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:40,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:40,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1912887145, now seen corresponding path program 4 times [2019-10-02 10:39:40,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:40,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:40,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:40,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:39:40,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 10:39:40,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:40,656 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:40,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:39:40,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:39:40,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:39:40,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 10:39:40,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 10:39:40,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:40,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 24 [2019-10-02 10:39:40,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 10:39:40,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 10:39:40,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2019-10-02 10:39:40,984 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 24 states. [2019-10-02 10:39:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:42,190 INFO L93 Difference]: Finished difference Result 267 states and 368 transitions. [2019-10-02 10:39:42,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 10:39:42,196 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2019-10-02 10:39:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:42,198 INFO L225 Difference]: With dead ends: 267 [2019-10-02 10:39:42,198 INFO L226 Difference]: Without dead ends: 260 [2019-10-02 10:39:42,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 10:39:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-02 10:39:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 213. [2019-10-02 10:39:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-02 10:39:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 283 transitions. [2019-10-02 10:39:42,219 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 283 transitions. Word has length 60 [2019-10-02 10:39:42,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:42,219 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 283 transitions. [2019-10-02 10:39:42,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 10:39:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 283 transitions. [2019-10-02 10:39:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 10:39:42,221 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:42,221 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2019-10-02 10:39:42,221 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:42,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:42,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1476746055, now seen corresponding path program 5 times [2019-10-02 10:39:42,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:42,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:42,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:42,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:39:42,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 10:39:42,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:42,981 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:43,055 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 10:39:43,100 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 10:39:43,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:39:43,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 88 conjunts are in the unsatisfiable core [2019-10-02 10:39:43,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:43,113 INFO L375 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 [2019-10-02 10:39:43,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:43,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 10:39:43,129 INFO L375 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 [2019-10-02 10:39:43,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:43,140 INFO L375 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 [2019-10-02 10:39:43,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:43,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,148 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-10-02 10:39:43,171 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:43,172 INFO L375 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 39 [2019-10-02 10:39:43,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,206 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-10-02 10:39:43,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2019-10-02 10:39:43,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:39:43,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:43,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:39:43,296 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:43,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2019-10-02 10:39:43,378 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:43,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-02 10:39:43,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:43,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:60 [2019-10-02 10:39:43,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:43,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 67 [2019-10-02 10:39:43,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,530 INFO L567 ElimStorePlain]: treesize reduction 48, result has 59.7 percent of original size [2019-10-02 10:39:43,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:39:43,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-02 10:39:43,537 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:43,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:43,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:84 [2019-10-02 10:39:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:39:44,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:44,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 34 [2019-10-02 10:39:44,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 10:39:44,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 10:39:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 10:39:44,842 INFO L87 Difference]: Start difference. First operand 213 states and 283 transitions. Second operand 34 states. [2019-10-02 10:39:45,918 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-10-02 10:39:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:48,125 INFO L93 Difference]: Finished difference Result 302 states and 397 transitions. [2019-10-02 10:39:48,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 10:39:48,125 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 61 [2019-10-02 10:39:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:48,130 INFO L225 Difference]: With dead ends: 302 [2019-10-02 10:39:48,131 INFO L226 Difference]: Without dead ends: 292 [2019-10-02 10:39:48,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 10:39:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-02 10:39:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 260. [2019-10-02 10:39:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-02 10:39:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 344 transitions. [2019-10-02 10:39:48,169 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 344 transitions. Word has length 61 [2019-10-02 10:39:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:48,171 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 344 transitions. [2019-10-02 10:39:48,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 10:39:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 344 transitions. [2019-10-02 10:39:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 10:39:48,174 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:48,174 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 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] [2019-10-02 10:39:48,174 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:48,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:48,175 INFO L82 PathProgramCache]: Analyzing trace with hash 841274153, now seen corresponding path program 6 times [2019-10-02 10:39:48,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:48,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:48,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:48,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:39:48,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 10:39:48,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:48,854 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:48,937 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 10:39:48,987 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 10:39:48,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:39:48,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 79 conjunts are in the unsatisfiable core [2019-10-02 10:39:48,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:49,000 INFO L375 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 [2019-10-02 10:39:49,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:49,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 10:39:49,013 INFO L375 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 [2019-10-02 10:39:49,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:49,026 INFO L375 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 [2019-10-02 10:39:49,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:49,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,033 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-10-02 10:39:49,062 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:49,063 INFO L375 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 39 [2019-10-02 10:39:49,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,102 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-10-02 10:39:49,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2019-10-02 10:39:49,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:39:49,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:49,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:39:49,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:49,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,212 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2019-10-02 10:39:49,313 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:49,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-02 10:39:49,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:49,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2019-10-02 10:39:49,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:49,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 75 [2019-10-02 10:39:49,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,459 INFO L567 ElimStorePlain]: treesize reduction 52, result has 56.7 percent of original size [2019-10-02 10:39:49,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-02 10:39:49,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:49,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:49,479 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:85 [2019-10-02 10:39:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 10:39:51,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:51,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2019-10-02 10:39:51,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 10:39:51,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 10:39:51,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1036, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 10:39:51,040 INFO L87 Difference]: Start difference. First operand 260 states and 344 transitions. Second operand 34 states. [2019-10-02 10:39:53,742 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-02 10:39:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:53,976 INFO L93 Difference]: Finished difference Result 304 states and 405 transitions. [2019-10-02 10:39:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 10:39:53,977 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-10-02 10:39:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:53,979 INFO L225 Difference]: With dead ends: 304 [2019-10-02 10:39:53,979 INFO L226 Difference]: Without dead ends: 284 [2019-10-02 10:39:53,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 10:39:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-10-02 10:39:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 248. [2019-10-02 10:39:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-02 10:39:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 330 transitions. [2019-10-02 10:39:54,003 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 330 transitions. Word has length 62 [2019-10-02 10:39:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:54,003 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 330 transitions. [2019-10-02 10:39:54,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 10:39:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 330 transitions. [2019-10-02 10:39:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 10:39:54,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:54,005 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 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] [2019-10-02 10:39:54,005 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -358704402, now seen corresponding path program 7 times [2019-10-02 10:39:54,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:54,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:54,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:54,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:39:54,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 10:39:54,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:54,110 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:54,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:54,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 10:39:54,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 10:39:54,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:54,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-10-02 10:39:54,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 10:39:54,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 10:39:54,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-02 10:39:54,261 INFO L87 Difference]: Start difference. First operand 248 states and 330 transitions. Second operand 13 states. [2019-10-02 10:39:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:39:54,509 INFO L93 Difference]: Finished difference Result 399 states and 551 transitions. [2019-10-02 10:39:54,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 10:39:54,510 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-10-02 10:39:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:39:54,512 INFO L225 Difference]: With dead ends: 399 [2019-10-02 10:39:54,512 INFO L226 Difference]: Without dead ends: 285 [2019-10-02 10:39:54,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-10-02 10:39:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-02 10:39:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 230. [2019-10-02 10:39:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-02 10:39:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 302 transitions. [2019-10-02 10:39:54,535 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 302 transitions. Word has length 65 [2019-10-02 10:39:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:39:54,536 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 302 transitions. [2019-10-02 10:39:54,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 10:39:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2019-10-02 10:39:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 10:39:54,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:39:54,538 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 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] [2019-10-02 10:39:54,538 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:39:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:39:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1441819211, now seen corresponding path program 8 times [2019-10-02 10:39:54,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:39:54,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:39:54,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:54,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:39:54,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:39:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:39:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 10:39:55,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:39:55,040 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:39:55,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:39:55,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:39:55,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:39:55,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 80 conjunts are in the unsatisfiable core [2019-10-02 10:39:55,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:39:55,237 INFO L375 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 [2019-10-02 10:39:55,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:55,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2019-10-02 10:39:55,280 INFO L375 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 [2019-10-02 10:39:55,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:55,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-10-02 10:39:55,328 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_31|], 1=[|v_#memory_$Pointer$.base_34|]} [2019-10-02 10:39:55,332 INFO L375 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 [2019-10-02 10:39:55,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:55,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:55,358 INFO L375 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 20 treesize of output 35 [2019-10-02 10:39:55,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:55,359 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,385 INFO L567 ElimStorePlain]: treesize reduction 12, result has 74.5 percent of original size [2019-10-02 10:39:55,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,386 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:36 [2019-10-02 10:39:55,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:55,445 INFO L375 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 31 treesize of output 35 [2019-10-02 10:39:55,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,459 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:55,459 INFO L375 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 36 treesize of output 40 [2019-10-02 10:39:55,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:55,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-02 10:39:55,487 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:56 [2019-10-02 10:39:55,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:55,555 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, v_prenex_18, v_prenex_17], 5=[|v_#memory_$Pointer$.base_35|]} [2019-10-02 10:39:55,565 INFO L375 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 49 treesize of output 48 [2019-10-02 10:39:55,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:55,612 INFO L375 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 44 treesize of output 43 [2019-10-02 10:39:55,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:55,653 INFO L375 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 40 treesize of output 39 [2019-10-02 10:39:55,653 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:55,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:39:55,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 74 [2019-10-02 10:39:55,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:55,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:55,706 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:39:55,780 INFO L567 ElimStorePlain]: treesize reduction 63, result has 57.7 percent of original size [2019-10-02 10:39:55,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 10:39:55,781 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:94, output treesize:104 [2019-10-02 10:39:56,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:56,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:56,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:56,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:56,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:56,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:56,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:39:57,319 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-10-02 10:39:57,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:39:57,637 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-10-02 10:39:57,922 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-10-02 10:39:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:39:58,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:39:58,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2019-10-02 10:39:58,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 10:39:58,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 10:39:58,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 10:39:58,049 INFO L87 Difference]: Start difference. First operand 230 states and 302 transitions. Second operand 36 states. [2019-10-02 10:39:59,859 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 65 [2019-10-02 10:40:00,120 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 92 [2019-10-02 10:40:00,403 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2019-10-02 10:40:00,736 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 113 [2019-10-02 10:40:01,918 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-10-02 10:40:02,441 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 122 [2019-10-02 10:40:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:40:02,901 INFO L93 Difference]: Finished difference Result 266 states and 344 transitions. [2019-10-02 10:40:02,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 10:40:02,902 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2019-10-02 10:40:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:40:02,904 INFO L225 Difference]: With dead ends: 266 [2019-10-02 10:40:02,904 INFO L226 Difference]: Without dead ends: 259 [2019-10-02 10:40:02,906 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=369, Invalid=2601, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 10:40:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-02 10:40:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 231. [2019-10-02 10:40:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-02 10:40:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 303 transitions. [2019-10-02 10:40:02,927 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 303 transitions. Word has length 67 [2019-10-02 10:40:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:40:02,927 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 303 transitions. [2019-10-02 10:40:02,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 10:40:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 303 transitions. [2019-10-02 10:40:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 10:40:02,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:40:02,929 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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] [2019-10-02 10:40:02,929 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:40:02,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:40:02,929 INFO L82 PathProgramCache]: Analyzing trace with hash 560064123, now seen corresponding path program 9 times [2019-10-02 10:40:02,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:40:02,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:40:02,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:40:02,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:40:02,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:40:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:40:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 10:40:03,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:40:03,180 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:40:03,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:40:03,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 10:40:03,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:40:03,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-02 10:40:03,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:40:03,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 10:40:03,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:40:03,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 25 [2019-10-02 10:40:03,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 10:40:03,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 10:40:03,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2019-10-02 10:40:03,518 INFO L87 Difference]: Start difference. First operand 231 states and 303 transitions. Second operand 25 states. [2019-10-02 10:40:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:40:04,586 INFO L93 Difference]: Finished difference Result 379 states and 596 transitions. [2019-10-02 10:40:04,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 10:40:04,595 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 68 [2019-10-02 10:40:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:40:04,598 INFO L225 Difference]: With dead ends: 379 [2019-10-02 10:40:04,598 INFO L226 Difference]: Without dead ends: 375 [2019-10-02 10:40:04,600 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 10:40:04,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-02 10:40:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 273. [2019-10-02 10:40:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-10-02 10:40:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 385 transitions. [2019-10-02 10:40:04,637 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 385 transitions. Word has length 68 [2019-10-02 10:40:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:40:04,637 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 385 transitions. [2019-10-02 10:40:04,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 10:40:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 385 transitions. [2019-10-02 10:40:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 10:40:04,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:40:04,639 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-10-02 10:40:04,639 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:40:04,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:40:04,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1673881246, now seen corresponding path program 1 times [2019-10-02 10:40:04,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:40:04,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:40:04,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:40:04,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:40:04,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:40:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:40:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 10:40:04,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:40:04,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:40:04,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:40:04,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:40:04,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:40:04,700 INFO L87 Difference]: Start difference. First operand 273 states and 385 transitions. Second operand 3 states. [2019-10-02 10:40:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:40:04,748 INFO L93 Difference]: Finished difference Result 375 states and 552 transitions. [2019-10-02 10:40:04,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:40:04,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-02 10:40:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:40:04,750 INFO L225 Difference]: With dead ends: 375 [2019-10-02 10:40:04,750 INFO L226 Difference]: Without dead ends: 279 [2019-10-02 10:40:04,751 INFO L640 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 [2019-10-02 10:40:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-02 10:40:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-10-02 10:40:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-02 10:40:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 390 transitions. [2019-10-02 10:40:04,778 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 390 transitions. Word has length 71 [2019-10-02 10:40:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:40:04,778 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 390 transitions. [2019-10-02 10:40:04,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:40:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 390 transitions. [2019-10-02 10:40:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 10:40:04,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:40:04,780 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-10-02 10:40:04,780 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:40:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:40:04,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1341222372, now seen corresponding path program 1 times [2019-10-02 10:40:04,781 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:40:04,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:40:04,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:40:04,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:40:04,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:40:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:40:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 10:40:04,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:40:04,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 10:40:04,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 10:40:04,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 10:40:04,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 10:40:04,866 INFO L87 Difference]: Start difference. First operand 277 states and 390 transitions. Second operand 9 states. [2019-10-02 10:40:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:40:05,040 INFO L93 Difference]: Finished difference Result 334 states and 510 transitions. [2019-10-02 10:40:05,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 10:40:05,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-10-02 10:40:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:40:05,044 INFO L225 Difference]: With dead ends: 334 [2019-10-02 10:40:05,044 INFO L226 Difference]: Without dead ends: 330 [2019-10-02 10:40:05,044 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 10:40:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-02 10:40:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 302. [2019-10-02 10:40:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-02 10:40:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 443 transitions. [2019-10-02 10:40:05,079 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 443 transitions. Word has length 71 [2019-10-02 10:40:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:40:05,079 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 443 transitions. [2019-10-02 10:40:05,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 10:40:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 443 transitions. [2019-10-02 10:40:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 10:40:05,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:40:05,082 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-10-02 10:40:05,082 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:40:05,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:40:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1806061963, now seen corresponding path program 10 times [2019-10-02 10:40:05,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:40:05,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:40:05,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:40:05,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:40:05,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:40:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:40:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 10:40:06,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:40:06,762 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:40:06,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:40:06,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:40:06,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:40:06,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 101 conjunts are in the unsatisfiable core [2019-10-02 10:40:06,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:40:06,907 INFO L375 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 [2019-10-02 10:40:06,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:40:06,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:06,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:40:06,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 10:40:06,971 INFO L375 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 [2019-10-02 10:40:06,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:40:06,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:06,983 INFO L375 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 [2019-10-02 10:40:06,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:40:06,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:06,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:40:06,992 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-10-02 10:40:07,049 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:07,050 INFO L375 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 15 [2019-10-02 10:40:07,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:40:07,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:07,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:40:07,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-10-02 10:40:07,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:40:07,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:40:07,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:07,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:40:07,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:40:07,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:07,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:40:07,151 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-10-02 10:40:07,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:07,314 INFO L375 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 42 treesize of output 79 [2019-10-02 10:40:07,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,322 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:40:07,388 INFO L567 ElimStorePlain]: treesize reduction 32, result has 66.0 percent of original size [2019-10-02 10:40:07,417 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:07,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2019-10-02 10:40:07,418 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:40:07,477 INFO L567 ElimStorePlain]: treesize reduction 32, result has 64.4 percent of original size [2019-10-02 10:40:07,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:40:07,479 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:67 [2019-10-02 10:40:07,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:07,785 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-02 10:40:07,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:40:07,793 INFO L392 ElimStorePlain]: Different costs {5=[v_prenex_32, v_prenex_30, v_prenex_35, v_prenex_33], 9=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_36|]} [2019-10-02 10:40:07,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:07,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 113 [2019-10-02 10:40:07,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:40:08,081 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-10-02 10:40:08,081 INFO L567 ElimStorePlain]: treesize reduction 44, result has 83.8 percent of original size [2019-10-02 10:40:08,122 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:08,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 100 [2019-10-02 10:40:08,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,126 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:40:08,341 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-10-02 10:40:08,341 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.8 percent of original size [2019-10-02 10:40:08,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:08,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 116 [2019-10-02 10:40:08,383 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:40:08,592 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-10-02 10:40:08,592 INFO L567 ElimStorePlain]: treesize reduction 44, result has 83.3 percent of original size [2019-10-02 10:40:08,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:08,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 66 treesize of output 100 [2019-10-02 10:40:08,628 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:40:08,807 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-10-02 10:40:08,808 INFO L567 ElimStorePlain]: treesize reduction 36, result has 85.4 percent of original size [2019-10-02 10:40:08,870 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:08,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 153 [2019-10-02 10:40:08,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:08,905 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:40:09,154 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-10-02 10:40:09,154 INFO L567 ElimStorePlain]: treesize reduction 48, result has 81.6 percent of original size [2019-10-02 10:40:09,216 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:40:09,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 157 [2019-10-02 10:40:09,217 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:40:09,447 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-10-02 10:40:09,448 INFO L567 ElimStorePlain]: treesize reduction 48, result has 81.3 percent of original size [2019-10-02 10:40:09,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-10-02 10:40:09,454 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:232, output treesize:244 [2019-10-02 10:40:09,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:09,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:10,554 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 68 [2019-10-02 10:40:10,811 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-10-02 10:40:11,082 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-10-02 10:40:11,839 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 153 [2019-10-02 10:40:12,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-02 10:40:13,350 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-10-02 10:40:13,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-02 10:40:14,008 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-02 10:40:14,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-02 10:40:14,980 WARN L191 SmtUtils]: Spent 719.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-02 10:40:14,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:40:14,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-10-02 10:40:14,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-10-02 10:40:17,863 WARN L191 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 646 [2019-10-02 10:40:17,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 20 terms [2019-10-02 10:40:21,095 WARN L191 SmtUtils]: Spent 2.60 s on a formula simplification that was a NOOP. DAG size: 650 [2019-10-02 10:40:21,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 20 terms [2019-10-02 10:40:29,037 WARN L191 SmtUtils]: Spent 7.25 s on a formula simplification that was a NOOP. DAG size: 674 [2019-10-02 10:40:36,828 WARN L191 SmtUtils]: Spent 6.63 s on a formula simplification that was a NOOP. DAG size: 1269 [2019-10-02 10:40:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 13 proven. 47 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 10:40:37,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:40:37,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2019-10-02 10:40:37,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 10:40:37,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 10:40:37,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1617, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 10:40:37,223 INFO L87 Difference]: Start difference. First operand 302 states and 443 transitions. Second operand 42 states. [2019-10-02 10:40:37,991 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-10-02 10:40:38,672 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 77 [2019-10-02 10:40:39,109 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 60 [2019-10-02 10:40:39,715 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 126 [2019-10-02 10:40:40,065 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-10-02 10:40:41,347 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 216 DAG size of output: 185 [2019-10-02 10:40:42,970 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-10-02 10:40:43,930 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-10-02 10:40:44,348 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-10-02 10:40:45,454 WARN L191 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 133 [2019-10-02 10:41:01,067 WARN L191 SmtUtils]: Spent 14.05 s on a formula simplification. DAG size of input: 1313 DAG size of output: 1272 [2019-10-02 10:41:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:41:02,936 INFO L93 Difference]: Finished difference Result 396 states and 584 transitions. [2019-10-02 10:41:02,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 10:41:02,936 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 69 [2019-10-02 10:41:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:41:02,939 INFO L225 Difference]: With dead ends: 396 [2019-10-02 10:41:02,940 INFO L226 Difference]: Without dead ends: 389 [2019-10-02 10:41:02,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=193, Invalid=2887, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 10:41:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-10-02 10:41:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 359. [2019-10-02 10:41:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-02 10:41:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 520 transitions. [2019-10-02 10:41:03,004 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 520 transitions. Word has length 69 [2019-10-02 10:41:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:41:03,004 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 520 transitions. [2019-10-02 10:41:03,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 10:41:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 520 transitions. [2019-10-02 10:41:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 10:41:03,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:41:03,007 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:41:03,008 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:41:03,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:41:03,008 INFO L82 PathProgramCache]: Analyzing trace with hash 935007276, now seen corresponding path program 1 times [2019-10-02 10:41:03,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:41:03,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:41:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:41:03,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:41:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:41:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:41:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 10:41:03,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:41:03,265 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:41:03,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:41:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:41:03,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 10:41:03,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:41:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 10:41:03,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:41:03,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2019-10-02 10:41:03,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 10:41:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 10:41:03,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-10-02 10:41:03,451 INFO L87 Difference]: Start difference. First operand 359 states and 520 transitions. Second operand 17 states. [2019-10-02 10:41:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:41:03,902 INFO L93 Difference]: Finished difference Result 556 states and 781 transitions. [2019-10-02 10:41:03,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 10:41:03,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-10-02 10:41:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:41:03,905 INFO L225 Difference]: With dead ends: 556 [2019-10-02 10:41:03,905 INFO L226 Difference]: Without dead ends: 341 [2019-10-02 10:41:03,907 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-10-02 10:41:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-10-02 10:41:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 290. [2019-10-02 10:41:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-02 10:41:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 364 transitions. [2019-10-02 10:41:03,958 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 364 transitions. Word has length 72 [2019-10-02 10:41:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:41:03,960 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 364 transitions. [2019-10-02 10:41:03,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 10:41:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 364 transitions. [2019-10-02 10:41:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 10:41:03,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:41:03,965 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 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] [2019-10-02 10:41:03,966 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:41:03,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:41:03,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2141526597, now seen corresponding path program 11 times [2019-10-02 10:41:03,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:41:03,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:41:03,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:41:03,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:41:03,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:41:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:41:04,376 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-10-02 10:41:04,809 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-10-02 10:41:05,010 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-02 10:41:05,198 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-02 10:41:05,396 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-02 10:41:05,624 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-10-02 10:41:05,838 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-02 10:41:06,360 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-10-02 10:41:06,604 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-10-02 10:41:06,856 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-10-02 10:41:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 10:41:06,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:41:06,891 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:41:06,996 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 10:41:07,080 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 10:41:07,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:41:07,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 107 conjunts are in the unsatisfiable core [2019-10-02 10:41:07,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:41:07,156 INFO L375 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 [2019-10-02 10:41:07,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:07,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:07,168 INFO L375 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 [2019-10-02 10:41:07,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:07,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:07,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:41:07,175 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-10-02 10:41:07,234 INFO L375 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 [2019-10-02 10:41:07,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:07,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:07,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:41:07,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2019-10-02 10:41:07,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:07,401 INFO L375 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 19 treesize of output 34 [2019-10-02 10:41:07,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:07,440 INFO L567 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-10-02 10:41:07,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:07,456 INFO L375 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 19 treesize of output 34 [2019-10-02 10:41:07,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:07,497 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.9 percent of original size [2019-10-02 10:41:07,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:41:07,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2019-10-02 10:41:07,601 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:07,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 74 [2019-10-02 10:41:07,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:07,625 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:07,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 78 [2019-10-02 10:41:07,626 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:07,741 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-10-02 10:41:07,742 INFO L567 ElimStorePlain]: treesize reduction 35, result has 73.7 percent of original size [2019-10-02 10:41:07,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-02 10:41:07,742 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:109, output treesize:98 [2019-10-02 10:41:07,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:07,858 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_143, v_prenex_144], 5=[|v_#memory_$Pointer$.offset_39|, |v_#memory_$Pointer$.base_42|]} [2019-10-02 10:41:07,875 INFO L375 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 62 treesize of output 61 [2019-10-02 10:41:07,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:07,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:07,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2019-10-02 10:41:07,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:08,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:08,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:41:08,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:08,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 103 [2019-10-02 10:41:08,045 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:08,168 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-02 10:41:08,169 INFO L567 ElimStorePlain]: treesize reduction 28, result has 81.6 percent of original size [2019-10-02 10:41:08,197 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:08,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 94 [2019-10-02 10:41:08,198 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:08,315 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-10-02 10:41:08,316 INFO L567 ElimStorePlain]: treesize reduction 36, result has 78.0 percent of original size [2019-10-02 10:41:08,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 10:41:08,317 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:136, output treesize:166 [2019-10-02 10:41:08,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:08,467 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:08,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 96 [2019-10-02 10:41:08,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:08,493 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:08,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 89 [2019-10-02 10:41:08,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:08,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:08,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 100 [2019-10-02 10:41:08,515 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:08,681 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-10-02 10:41:08,681 INFO L567 ElimStorePlain]: treesize reduction 23, result has 90.2 percent of original size [2019-10-02 10:41:08,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-10-02 10:41:08,682 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:256, output treesize:212 [2019-10-02 10:41:09,080 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-10-02 10:41:09,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:41:09,087 INFO L392 ElimStorePlain]: Different costs {5=[v_prenex_150, v_prenex_146, v_prenex_147, v_prenex_149], 9=[|v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_43|]} [2019-10-02 10:41:09,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:09,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 100 [2019-10-02 10:41:09,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:09,424 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-10-02 10:41:09,424 INFO L567 ElimStorePlain]: treesize reduction 32, result has 89.5 percent of original size [2019-10-02 10:41:09,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:41:09,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 97 [2019-10-02 10:41:09,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:09,565 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-10-02 10:41:09,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:09,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:09,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 96 [2019-10-02 10:41:09,598 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:09,822 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-10-02 10:41:09,823 INFO L567 ElimStorePlain]: treesize reduction 40, result has 86.2 percent of original size [2019-10-02 10:41:09,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:41:09,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 81 [2019-10-02 10:41:09,842 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:09,945 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-02 10:41:09,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:09,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:41:09,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:41:09,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:41:09,983 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:09,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 143 [2019-10-02 10:41:09,984 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:10,177 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-10-02 10:41:10,177 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.8 percent of original size [2019-10-02 10:41:10,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:10,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 141 [2019-10-02 10:41:10,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:10,239 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:41:10,440 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-10-02 10:41:10,440 INFO L567 ElimStorePlain]: treesize reduction 84, result has 73.4 percent of original size [2019-10-02 10:41:10,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-02 10:41:10,441 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:281, output treesize:312 [2019-10-02 10:41:11,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:13,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:41:13,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:14,554 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-10-02 10:41:14,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:41:14,921 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-10-02 10:41:14,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:41:15,343 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-10-02 10:41:15,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:41:15,843 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-02 10:41:15,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:41:16,443 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-10-02 10:41:16,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:41:17,529 WARN L191 SmtUtils]: Spent 835.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-10-02 10:41:17,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 10:41:18,686 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-02 10:41:19,843 WARN L191 SmtUtils]: Spent 774.00 ms on a formula simplification that was a NOOP. DAG size: 309 [2019-10-02 10:41:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 13 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 10:41:20,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:41:20,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 46 [2019-10-02 10:41:20,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 10:41:20,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 10:41:20,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1950, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 10:41:20,064 INFO L87 Difference]: Start difference. First operand 290 states and 364 transitions. Second operand 46 states. [2019-10-02 10:41:20,772 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-10-02 10:41:21,406 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 70 [2019-10-02 10:41:21,899 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 47 [2019-10-02 10:41:22,508 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 69 [2019-10-02 10:41:22,851 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 41 [2019-10-02 10:41:23,797 WARN L191 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 107 [2019-10-02 10:41:25,382 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2019-10-02 10:41:26,130 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 41 [2019-10-02 10:41:26,497 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-10-02 10:41:27,390 WARN L191 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 70 [2019-10-02 10:41:29,973 WARN L191 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 321 DAG size of output: 312 [2019-10-02 10:41:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:41:30,493 INFO L93 Difference]: Finished difference Result 347 states and 441 transitions. [2019-10-02 10:41:30,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 10:41:30,493 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 70 [2019-10-02 10:41:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:41:30,495 INFO L225 Difference]: With dead ends: 347 [2019-10-02 10:41:30,496 INFO L226 Difference]: Without dead ends: 340 [2019-10-02 10:41:30,497 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=207, Invalid=3333, Unknown=0, NotChecked=0, Total=3540 [2019-10-02 10:41:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-10-02 10:41:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 291. [2019-10-02 10:41:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-02 10:41:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 365 transitions. [2019-10-02 10:41:30,545 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 365 transitions. Word has length 70 [2019-10-02 10:41:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:41:30,545 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 365 transitions. [2019-10-02 10:41:30,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 10:41:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 365 transitions. [2019-10-02 10:41:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 10:41:30,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:41:30,547 INFO L411 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 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] [2019-10-02 10:41:30,548 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:41:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:41:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash 343971637, now seen corresponding path program 12 times [2019-10-02 10:41:30,548 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:41:30,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:41:30,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:41:30,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:41:30,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:41:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:41:31,015 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-10-02 10:41:31,196 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-10-02 10:41:31,420 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-02 10:41:31,945 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-10-02 10:41:32,566 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-10-02 10:41:32,780 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-10-02 10:41:32,966 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-10-02 10:41:33,165 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-10-02 10:41:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 10:41:33,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:41:33,201 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:41:33,307 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 10:41:33,370 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-10-02 10:41:33,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:41:33,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 105 conjunts are in the unsatisfiable core [2019-10-02 10:41:33,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:41:33,380 INFO L375 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 [2019-10-02 10:41:33,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:33,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:33,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:41:33,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 10:41:33,448 INFO L375 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 [2019-10-02 10:41:33,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:33,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:33,461 INFO L375 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 [2019-10-02 10:41:33,462 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:33,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:33,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:41:33,471 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-10-02 10:41:33,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:33,533 INFO L375 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 15 [2019-10-02 10:41:33,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:33,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:33,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:41:33,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-10-02 10:41:33,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:41:33,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:33,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:33,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:41:33,626 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:33,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:33,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:41:33,639 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-10-02 10:41:33,791 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:33,791 INFO L375 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 42 treesize of output 79 [2019-10-02 10:41:33,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:33,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:33,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:33,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:33,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:33,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:33,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:33,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:33,796 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:41:33,858 INFO L567 ElimStorePlain]: treesize reduction 32, result has 66.0 percent of original size [2019-10-02 10:41:33,889 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:33,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2019-10-02 10:41:33,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:33,953 INFO L567 ElimStorePlain]: treesize reduction 32, result has 64.4 percent of original size [2019-10-02 10:41:33,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:33,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:33,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:41:33,956 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:67 [2019-10-02 10:41:33,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:33,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:34,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:34,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:34,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:34,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:34,278 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-10-02 10:41:34,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:41:34,285 INFO L392 ElimStorePlain]: Different costs {5=[v_prenex_190, v_prenex_185, v_prenex_187, v_prenex_188], 9=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_44|]} [2019-10-02 10:41:34,342 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:34,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 112 [2019-10-02 10:41:34,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:34,593 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-10-02 10:41:34,593 INFO L567 ElimStorePlain]: treesize reduction 44, result has 83.1 percent of original size [2019-10-02 10:41:34,650 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:34,651 INFO L375 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 63 treesize of output 100 [2019-10-02 10:41:34,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:34,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:34,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:34,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:34,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:34,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:34,655 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:41:34,877 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-10-02 10:41:34,877 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.3 percent of original size [2019-10-02 10:41:34,920 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:34,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 92 [2019-10-02 10:41:34,921 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:35,124 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-10-02 10:41:35,125 INFO L567 ElimStorePlain]: treesize reduction 32, result has 86.6 percent of original size [2019-10-02 10:41:35,161 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:35,162 INFO L375 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 96 [2019-10-02 10:41:35,163 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:35,360 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-10-02 10:41:35,361 INFO L567 ElimStorePlain]: treesize reduction 36, result has 84.7 percent of original size [2019-10-02 10:41:35,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:35,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 149 [2019-10-02 10:41:35,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:35,508 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:41:35,738 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-10-02 10:41:35,738 INFO L567 ElimStorePlain]: treesize reduction 48, result has 80.7 percent of original size [2019-10-02 10:41:35,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:41:35,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 153 [2019-10-02 10:41:35,827 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:41:36,046 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-10-02 10:41:36,047 INFO L567 ElimStorePlain]: treesize reduction 48, result has 80.4 percent of original size [2019-10-02 10:41:36,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-10-02 10:41:36,054 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:220, output treesize:232 [2019-10-02 10:41:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:36,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:37,508 WARN L191 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 73 [2019-10-02 10:41:37,982 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-02 10:41:38,450 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-10-02 10:41:39,064 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 145 [2019-10-02 10:41:39,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-02 10:41:41,075 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-10-02 10:41:41,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-02 10:41:41,652 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-02 10:41:41,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-02 10:41:44,899 WARN L191 SmtUtils]: Spent 3.00 s on a formula simplification that was a NOOP. DAG size: 173 [2019-10-02 10:41:44,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-10-02 10:41:46,472 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 318 [2019-10-02 10:41:46,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-10-02 10:41:48,471 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 322 [2019-10-02 10:41:48,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:41:48,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-10-02 10:41:48,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-10-02 10:41:56,307 WARN L191 SmtUtils]: Spent 7.16 s on a formula simplification that was a NOOP. DAG size: 622 [2019-10-02 10:41:56,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 20 terms [2019-10-02 10:42:02,316 WARN L191 SmtUtils]: Spent 5.33 s on a formula simplification that was a NOOP. DAG size: 626 [2019-10-02 10:42:02,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 20 terms [2019-10-02 10:42:07,812 WARN L191 SmtUtils]: Spent 4.74 s on a formula simplification that was a NOOP. DAG size: 626 [2019-10-02 10:42:17,266 WARN L191 SmtUtils]: Spent 8.74 s on a formula simplification that was a NOOP. DAG size: 625 [2019-10-02 10:42:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 10:42:17,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:42:17,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2019-10-02 10:42:17,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 10:42:17,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 10:42:17,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1952, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 10:42:17,494 INFO L87 Difference]: Start difference. First operand 291 states and 365 transitions. Second operand 46 states. [2019-10-02 10:42:18,308 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-10-02 10:42:19,379 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2019-10-02 10:42:19,808 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-10-02 10:42:20,470 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 133 [2019-10-02 10:42:20,791 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2019-10-02 10:42:21,859 WARN L191 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 191 [2019-10-02 10:42:24,219 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-10-02 10:42:25,320 WARN L191 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-10-02 10:42:25,929 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 84 [2019-10-02 10:42:27,339 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 191 DAG size of output: 147 [2019-10-02 10:42:43,674 WARN L191 SmtUtils]: Spent 14.87 s on a formula simplification. DAG size of input: 649 DAG size of output: 628 [2019-10-02 10:42:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:42:44,748 INFO L93 Difference]: Finished difference Result 356 states and 454 transitions. [2019-10-02 10:42:44,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 10:42:44,749 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 71 [2019-10-02 10:42:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:42:44,751 INFO L225 Difference]: With dead ends: 356 [2019-10-02 10:42:44,751 INFO L226 Difference]: Without dead ends: 349 [2019-10-02 10:42:44,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 64.6s TimeCoverageRelationStatistics Valid=204, Invalid=3336, Unknown=0, NotChecked=0, Total=3540 [2019-10-02 10:42:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-02 10:42:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 292. [2019-10-02 10:42:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-02 10:42:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 366 transitions. [2019-10-02 10:42:44,814 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 366 transitions. Word has length 71 [2019-10-02 10:42:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:42:44,815 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 366 transitions. [2019-10-02 10:42:44,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 10:42:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 366 transitions. [2019-10-02 10:42:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 10:42:44,816 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:42:44,817 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 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] [2019-10-02 10:42:44,817 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:42:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:42:44,817 INFO L82 PathProgramCache]: Analyzing trace with hash 642633996, now seen corresponding path program 2 times [2019-10-02 10:42:44,817 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:42:44,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:42:44,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:42:44,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:42:44,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:42:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:42:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 10:42:44,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:42:44,988 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:42:45,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:42:45,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:42:45,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:42:45,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 10:42:45,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:42:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 34 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 10:42:45,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:42:45,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 20 [2019-10-02 10:42:45,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 10:42:45,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 10:42:45,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-10-02 10:42:45,258 INFO L87 Difference]: Start difference. First operand 292 states and 366 transitions. Second operand 20 states. [2019-10-02 10:42:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:42:46,584 INFO L93 Difference]: Finished difference Result 646 states and 872 transitions. [2019-10-02 10:42:46,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 10:42:46,585 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2019-10-02 10:42:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:42:46,588 INFO L225 Difference]: With dead ends: 646 [2019-10-02 10:42:46,588 INFO L226 Difference]: Without dead ends: 467 [2019-10-02 10:42:46,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=302, Invalid=1504, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 10:42:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-10-02 10:42:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 292. [2019-10-02 10:42:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-02 10:42:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 363 transitions. [2019-10-02 10:42:46,663 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 363 transitions. Word has length 71 [2019-10-02 10:42:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:42:46,664 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 363 transitions. [2019-10-02 10:42:46,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 10:42:46,664 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 363 transitions. [2019-10-02 10:42:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 10:42:46,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:42:46,666 INFO L411 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 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] [2019-10-02 10:42:46,666 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:42:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:42:46,666 INFO L82 PathProgramCache]: Analyzing trace with hash 85005563, now seen corresponding path program 13 times [2019-10-02 10:42:46,666 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:42:46,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:42:46,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:42:46,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:42:46,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:42:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:42:47,598 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-10-02 10:42:47,894 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-10-02 10:42:48,117 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-02 10:42:48,349 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-02 10:42:48,586 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-10-02 10:42:48,816 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-02 10:42:49,390 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-10-02 10:42:49,710 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-10-02 10:42:50,028 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-10-02 10:42:50,306 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-10-02 10:42:50,576 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-10-02 10:42:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 10:42:50,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:42:50,619 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:42:50,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:42:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:42:50,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 110 conjunts are in the unsatisfiable core [2019-10-02 10:42:50,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:42:50,852 INFO L375 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 [2019-10-02 10:42:50,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:50,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:50,862 INFO L375 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 [2019-10-02 10:42:50,862 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:50,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:50,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:42:50,870 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-10-02 10:42:51,003 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:51,003 INFO L375 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 19 treesize of output 34 [2019-10-02 10:42:51,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:51,038 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-10-02 10:42:51,057 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:51,057 INFO L375 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 19 treesize of output 34 [2019-10-02 10:42:51,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:51,095 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2019-10-02 10:42:51,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:42:51,096 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:41 [2019-10-02 10:42:51,171 INFO L375 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 38 treesize of output 37 [2019-10-02 10:42:51,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:51,177 INFO L375 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 42 treesize of output 41 [2019-10-02 10:42:51,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:51,243 INFO L567 ElimStorePlain]: treesize reduction 7, result has 91.1 percent of original size [2019-10-02 10:42:51,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-02 10:42:51,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:72 [2019-10-02 10:42:51,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,337 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_50|], 5=[v_prenex_256, v_prenex_257]} [2019-10-02 10:42:51,374 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:51,374 INFO L375 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 49 treesize of output 76 [2019-10-02 10:42:51,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:51,502 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-02 10:42:51,503 INFO L567 ElimStorePlain]: treesize reduction 28, result has 79.1 percent of original size [2019-10-02 10:42:51,523 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:51,524 INFO L375 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 45 treesize of output 56 [2019-10-02 10:42:51,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:51,660 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-02 10:42:51,661 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.0 percent of original size [2019-10-02 10:42:51,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:51,724 INFO L375 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 118 [2019-10-02 10:42:51,725 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:51,829 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-10-02 10:42:51,829 INFO L567 ElimStorePlain]: treesize reduction 44, result has 68.1 percent of original size [2019-10-02 10:42:51,869 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:51,869 INFO L375 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 56 treesize of output 97 [2019-10-02 10:42:51,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:51,880 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:42:52,037 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-02 10:42:52,038 INFO L567 ElimStorePlain]: treesize reduction 24, result has 81.4 percent of original size [2019-10-02 10:42:52,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-02 10:42:52,041 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:110, output treesize:119 [2019-10-02 10:42:52,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:52,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:52,423 INFO L375 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 68 treesize of output 72 [2019-10-02 10:42:52,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:52,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:52,437 INFO L375 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 54 treesize of output 58 [2019-10-02 10:42:52,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:52,445 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:42:52,446 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:42:52,447 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2019-10-02 10:42:52,448 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:52,454 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 10:42:52,454 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:52,462 INFO L375 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 0 case distinctions, treesize of input 60 treesize of output 56 [2019-10-02 10:42:52,462 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:52,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:52,475 INFO L375 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 85 treesize of output 89 [2019-10-02 10:42:52,475 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:52,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:52,488 INFO L375 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 65 treesize of output 69 [2019-10-02 10:42:52,489 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:52,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:42:52,495 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2019-10-02 10:42:52,496 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:52,634 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-10-02 10:42:52,634 INFO L567 ElimStorePlain]: treesize reduction 143, result has 52.2 percent of original size [2019-10-02 10:42:52,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-10-02 10:42:52,635 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:529, output treesize:156 [2019-10-02 10:42:52,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:42:52,777 INFO L392 ElimStorePlain]: Different costs {5=[v_prenex_260, |v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_51|, v_prenex_259], 9=[v_prenex_262, v_prenex_263]} [2019-10-02 10:42:52,808 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:52,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 88 [2019-10-02 10:42:52,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:53,090 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-10-02 10:42:53,091 INFO L567 ElimStorePlain]: treesize reduction 20, result has 91.6 percent of original size [2019-10-02 10:42:53,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:53,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 105 [2019-10-02 10:42:53,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:53,352 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2019-10-02 10:42:53,353 INFO L567 ElimStorePlain]: treesize reduction 44, result has 82.9 percent of original size [2019-10-02 10:42:53,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:53,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 84 [2019-10-02 10:42:53,384 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:53,571 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-10-02 10:42:53,571 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.2 percent of original size [2019-10-02 10:42:53,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:53,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 113 [2019-10-02 10:42:53,611 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:53,788 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-10-02 10:42:53,788 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.0 percent of original size [2019-10-02 10:42:53,898 INFO L341 Elim1Store]: treesize reduction 12, result has 91.6 percent of original size [2019-10-02 10:42:53,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 191 [2019-10-02 10:42:53,899 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:42:54,071 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-10-02 10:42:54,071 INFO L567 ElimStorePlain]: treesize reduction 68, result has 74.7 percent of original size [2019-10-02 10:42:54,136 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:42:54,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 133 [2019-10-02 10:42:54,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,145 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:42:54,350 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-10-02 10:42:54,350 INFO L567 ElimStorePlain]: treesize reduction 48, result has 82.6 percent of original size [2019-10-02 10:42:54,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-10-02 10:42:54,354 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:213, output treesize:283 [2019-10-02 10:42:54,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,623 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-10-02 10:42:54,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:54,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:55,204 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-10-02 10:42:56,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:42:57,126 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-10-02 10:42:57,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:42:57,504 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-10-02 10:42:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:42:57,934 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-10-02 10:42:57,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:42:58,731 WARN L191 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-10-02 10:42:58,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 10:42:59,825 WARN L191 SmtUtils]: Spent 729.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2019-10-02 10:42:59,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:42:59,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 10:42:59,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 10:43:02,170 WARN L191 SmtUtils]: Spent 1.77 s on a formula simplification that was a NOOP. DAG size: 530 [2019-10-02 10:43:02,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-10-02 10:43:05,021 WARN L191 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 534 [2019-10-02 10:43:05,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-10-02 10:43:08,220 WARN L191 SmtUtils]: Spent 2.59 s on a formula simplification that was a NOOP. DAG size: 538 [2019-10-02 10:43:08,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-10-02 10:43:11,480 WARN L191 SmtUtils]: Spent 2.62 s on a formula simplification that was a NOOP. DAG size: 538 [2019-10-02 10:43:14,576 WARN L191 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 537 [2019-10-02 10:43:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 10:43:14,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:43:14,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2019-10-02 10:43:14,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 10:43:14,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 10:43:14,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2132, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 10:43:14,784 INFO L87 Difference]: Start difference. First operand 292 states and 363 transitions. Second operand 48 states. [2019-10-02 10:43:15,615 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-10-02 10:43:16,184 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 42 [2019-10-02 10:43:16,616 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 50 [2019-10-02 10:43:17,393 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 100 [2019-10-02 10:43:17,775 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2019-10-02 10:43:18,884 WARN L191 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 153 [2019-10-02 10:43:21,175 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-10-02 10:43:21,862 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2019-10-02 10:43:22,232 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 54 [2019-10-02 10:43:23,165 WARN L191 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 100 [2019-10-02 10:43:29,639 WARN L191 SmtUtils]: Spent 5.24 s on a formula simplification. DAG size of input: 557 DAG size of output: 540 [2019-10-02 10:43:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:43:30,207 INFO L93 Difference]: Finished difference Result 365 states and 463 transitions. [2019-10-02 10:43:30,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 10:43:30,207 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 72 [2019-10-02 10:43:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:43:30,210 INFO L225 Difference]: With dead ends: 365 [2019-10-02 10:43:30,211 INFO L226 Difference]: Without dead ends: 358 [2019-10-02 10:43:30,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=210, Invalid=3572, Unknown=0, NotChecked=0, Total=3782 [2019-10-02 10:43:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-10-02 10:43:30,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 293. [2019-10-02 10:43:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-02 10:43:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 364 transitions. [2019-10-02 10:43:30,287 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 364 transitions. Word has length 72 [2019-10-02 10:43:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:43:30,288 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 364 transitions. [2019-10-02 10:43:30,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-02 10:43:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 364 transitions. [2019-10-02 10:43:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 10:43:30,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:43:30,290 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:43:30,290 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:43:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:43:30,290 INFO L82 PathProgramCache]: Analyzing trace with hash 10025111, now seen corresponding path program 1 times [2019-10-02 10:43:30,290 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:43:30,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:43:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:43:30,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:43:30,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:43:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:43:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 10:43:30,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:43:30,765 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:43:30,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:43:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:43:30,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-02 10:43:30,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:43:35,238 INFO L375 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 8 treesize of output 4 [2019-10-02 10:43:35,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:43:35,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:43:35,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:43:35,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 10:43:37,380 INFO L375 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 [2019-10-02 10:43:37,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:43:37,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:43:37,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:43:37,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:49 [2019-10-02 10:43:39,395 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_insert_~new_node~0.base Int)) (and (<= (+ |c_#StackHeapBarrier| 1) sll_insert_~new_node~0.base) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (select (select |c_#memory_$Pointer$.offset| |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (select (select |c_old(#memory_$Pointer$.base)| |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))))) (store .cse0 |c_sll_insert_#in~head.base| (store (select .cse0 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset| sll_insert_~new_node~0.base)))))) is different from true [2019-10-02 10:43:39,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:43:39,410 INFO L375 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 52 treesize of output 23 [2019-10-02 10:43:39,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:43:39,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:43:39,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:43:39,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:29 [2019-10-02 10:43:39,476 INFO L375 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 16 [2019-10-02 10:43:39,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:43:39,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:43:39,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:43:39,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2019-10-02 10:43:41,543 WARN L860 $PredicateComparison]: unable to prove that (exists ((|main_~#s~0.base| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_11| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (and (<= (+ |main_~#s~0.base| 2) .cse0) (not (= 0 (select (select |c_#memory_$Pointer$.base| .cse0) |v_main_#t~mem19.offset_BEFORE_CALL_11|)))))) is different from true [2019-10-02 10:43:45,595 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-10-02 10:43:49,645 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-10-02 10:43:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 10:43:49,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:43:49,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 33 [2019-10-02 10:43:49,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 10:43:49,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 10:43:49,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=844, Unknown=6, NotChecked=118, Total=1056 [2019-10-02 10:43:49,713 INFO L87 Difference]: Start difference. First operand 293 states and 364 transitions. Second operand 33 states. [2019-10-02 10:44:08,711 WARN L191 SmtUtils]: Spent 6.11 s on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-10-02 10:44:14,814 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 58 [2019-10-02 10:44:43,435 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-10-02 10:44:44,204 WARN L191 SmtUtils]: Spent 734.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-10-02 10:44:44,878 WARN L191 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-10-02 10:44:45,573 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-10-02 10:45:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:45:46,454 INFO L93 Difference]: Finished difference Result 340 states and 427 transitions. [2019-10-02 10:45:46,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 10:45:46,455 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 75 [2019-10-02 10:45:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:45:46,457 INFO L225 Difference]: With dead ends: 340 [2019-10-02 10:45:46,457 INFO L226 Difference]: Without dead ends: 330 [2019-10-02 10:45:46,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 86.3s TimeCoverageRelationStatistics Valid=233, Invalid=2603, Unknown=34, NotChecked=210, Total=3080 [2019-10-02 10:45:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-02 10:45:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 308. [2019-10-02 10:45:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-10-02 10:45:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 386 transitions. [2019-10-02 10:45:46,528 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 386 transitions. Word has length 75 [2019-10-02 10:45:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:45:46,528 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 386 transitions. [2019-10-02 10:45:46,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 10:45:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 386 transitions. [2019-10-02 10:45:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 10:45:46,530 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:45:46,531 INFO L411 BasicCegarLoop]: trace histogram [9, 5, 4, 4, 4, 4, 4, 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] [2019-10-02 10:45:46,531 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:45:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:45:46,531 INFO L82 PathProgramCache]: Analyzing trace with hash 646991861, now seen corresponding path program 14 times [2019-10-02 10:45:46,532 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:45:46,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:45:46,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:45:46,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:45:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:45:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:45:47,012 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-10-02 10:45:47,182 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-10-02 10:45:47,363 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-10-02 10:45:47,507 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-10-02 10:45:47,657 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2019-10-02 10:45:47,821 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-10-02 10:45:48,011 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-10-02 10:45:48,186 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-10-02 10:45:48,770 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-10-02 10:45:49,041 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-10-02 10:45:49,343 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-10-02 10:45:49,651 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2019-10-02 10:45:49,880 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2019-10-02 10:45:50,097 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-10-02 10:45:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 10:45:50,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:45:50,141 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:45:50,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:45:50,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:45:50,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:45:50,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 121 conjunts are in the unsatisfiable core [2019-10-02 10:45:50,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:45:50,323 INFO L375 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 [2019-10-02 10:45:50,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:50,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 10:45:50,415 INFO L375 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 [2019-10-02 10:45:50,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:50,428 INFO L375 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 [2019-10-02 10:45:50,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:50,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-10-02 10:45:50,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:50,514 INFO L375 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 15 [2019-10-02 10:45:50,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:50,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-10-02 10:45:50,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:45:50,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:50,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:45:50,615 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:50,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,630 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-10-02 10:45:50,715 INFO L375 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 [2019-10-02 10:45:50,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:50,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:45:50,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:49 [2019-10-02 10:45:50,856 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:50,856 INFO L375 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 42 treesize of output 79 [2019-10-02 10:45:50,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:50,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:50,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:50,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:50,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:50,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:50,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:50,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:50,860 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:45:50,927 INFO L567 ElimStorePlain]: treesize reduction 32, result has 67.7 percent of original size [2019-10-02 10:45:50,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:50,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2019-10-02 10:45:50,964 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:51,040 INFO L567 ElimStorePlain]: treesize reduction 32, result has 66.3 percent of original size [2019-10-02 10:45:51,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:51,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:51,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:45:51,043 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:72 [2019-10-02 10:45:51,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:51,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:51,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:51,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:51,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:51,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:51,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:51,255 INFO L375 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 85 treesize of output 89 [2019-10-02 10:45:51,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:51,269 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:51,270 INFO L375 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 81 treesize of output 85 [2019-10-02 10:45:51,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:51,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:51,285 INFO L375 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 68 treesize of output 72 [2019-10-02 10:45:51,286 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:51,438 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-02 10:45:51,438 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-10-02 10:45:51,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-10-02 10:45:51,439 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:235, output treesize:203 [2019-10-02 10:45:51,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:45:51,621 INFO L392 ElimStorePlain]: Different costs {5=[v_prenex_305, |v_#memory_$Pointer$.base_57|, v_prenex_303, |v_#memory_$Pointer$.offset_53|], 9=[v_prenex_300, v_prenex_302]} [2019-10-02 10:45:51,659 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:51,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 92 [2019-10-02 10:45:51,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:51,983 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-10-02 10:45:51,983 INFO L567 ElimStorePlain]: treesize reduction 16, result has 94.1 percent of original size [2019-10-02 10:45:52,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:52,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 92 [2019-10-02 10:45:52,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:52,302 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-10-02 10:45:52,303 INFO L567 ElimStorePlain]: treesize reduction 32, result has 87.9 percent of original size [2019-10-02 10:45:52,342 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:52,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 88 [2019-10-02 10:45:52,344 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:52,577 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2019-10-02 10:45:52,578 INFO L567 ElimStorePlain]: treesize reduction 20, result has 91.8 percent of original size [2019-10-02 10:45:52,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:45:52,611 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:52,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 93 [2019-10-02 10:45:52,612 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:52,836 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-10-02 10:45:52,836 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.7 percent of original size [2019-10-02 10:45:52,889 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:52,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 141 [2019-10-02 10:45:52,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:52,903 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:45:53,139 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-10-02 10:45:53,139 INFO L567 ElimStorePlain]: treesize reduction 68, result has 76.3 percent of original size [2019-10-02 10:45:53,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:45:53,201 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:45:53,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 154 [2019-10-02 10:45:53,203 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:45:53,420 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-10-02 10:45:53,421 INFO L567 ElimStorePlain]: treesize reduction 44, result has 83.0 percent of original size [2019-10-02 10:45:53,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:53,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:53,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:53,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-10-02 10:45:53,423 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:260, output treesize:266 [2019-10-02 10:45:53,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:53,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:53,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:53,707 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-10-02 10:45:53,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:53,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:53,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:53,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:53,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:53,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:45:54,242 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-10-02 10:45:55,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:45:56,426 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-10-02 10:45:56,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:45:56,828 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-10-02 10:45:56,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:45:57,624 WARN L191 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2019-10-02 10:45:57,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 10:45:58,673 WARN L191 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2019-10-02 10:45:58,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 10:45:59,859 WARN L191 SmtUtils]: Spent 790.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2019-10-02 10:45:59,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 10:46:02,294 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 286 [2019-10-02 10:46:02,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-10-02 10:46:05,244 WARN L191 SmtUtils]: Spent 2.33 s on a formula simplification that was a NOOP. DAG size: 522 [2019-10-02 10:46:05,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-10-02 10:46:08,668 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification that was a NOOP. DAG size: 526 [2019-10-02 10:46:08,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-10-02 10:46:12,459 WARN L191 SmtUtils]: Spent 3.13 s on a formula simplification that was a NOOP. DAG size: 530 [2019-10-02 10:46:12,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-10-02 10:46:16,108 WARN L191 SmtUtils]: Spent 2.97 s on a formula simplification that was a NOOP. DAG size: 530 [2019-10-02 10:46:19,604 WARN L191 SmtUtils]: Spent 2.81 s on a formula simplification that was a NOOP. DAG size: 529 [2019-10-02 10:46:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 10:46:19,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:46:19,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2019-10-02 10:46:19,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 10:46:19,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 10:46:19,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=2322, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 10:46:19,819 INFO L87 Difference]: Start difference. First operand 308 states and 386 transitions. Second operand 50 states. [2019-10-02 10:46:20,656 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-10-02 10:46:21,329 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 67 [2019-10-02 10:46:21,834 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 61 [2019-10-02 10:46:22,641 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2019-10-02 10:46:23,076 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-10-02 10:46:24,277 WARN L191 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 155 [2019-10-02 10:46:27,113 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-10-02 10:46:27,808 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-10-02 10:46:28,230 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-10-02 10:46:29,470 WARN L191 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-10-02 10:46:37,806 WARN L191 SmtUtils]: Spent 6.40 s on a formula simplification. DAG size of input: 549 DAG size of output: 532 [2019-10-02 10:46:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:46:38,551 INFO L93 Difference]: Finished difference Result 385 states and 501 transitions. [2019-10-02 10:46:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 10:46:38,552 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 73 [2019-10-02 10:46:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:46:38,554 INFO L225 Difference]: With dead ends: 385 [2019-10-02 10:46:38,554 INFO L226 Difference]: Without dead ends: 378 [2019-10-02 10:46:38,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 42.0s TimeCoverageRelationStatistics Valid=212, Invalid=3820, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 10:46:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-02 10:46:38,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 309. [2019-10-02 10:46:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-02 10:46:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 387 transitions. [2019-10-02 10:46:38,647 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 387 transitions. Word has length 73 [2019-10-02 10:46:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:46:38,649 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 387 transitions. [2019-10-02 10:46:38,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 10:46:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 387 transitions. [2019-10-02 10:46:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 10:46:38,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:46:38,651 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 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] [2019-10-02 10:46:38,651 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:46:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:46:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash 758242734, now seen corresponding path program 15 times [2019-10-02 10:46:38,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:46:38,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:46:38,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:46:38,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:46:38,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:46:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:46:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 10:46:38,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:46:38,861 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:46:38,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:46:39,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-02 10:46:39,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:46:39,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 10:46:39,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:46:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 10:46:39,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:46:39,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-10-02 10:46:39,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 10:46:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 10:46:39,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-10-02 10:46:39,068 INFO L87 Difference]: Start difference. First operand 309 states and 387 transitions. Second operand 15 states. [2019-10-02 10:46:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:46:39,449 INFO L93 Difference]: Finished difference Result 526 states and 690 transitions. [2019-10-02 10:46:39,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 10:46:39,450 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2019-10-02 10:46:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:46:39,452 INFO L225 Difference]: With dead ends: 526 [2019-10-02 10:46:39,452 INFO L226 Difference]: Without dead ends: 389 [2019-10-02 10:46:39,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-10-02 10:46:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-10-02 10:46:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 310. [2019-10-02 10:46:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-10-02 10:46:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2019-10-02 10:46:39,536 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 73 [2019-10-02 10:46:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:46:39,537 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2019-10-02 10:46:39,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 10:46:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2019-10-02 10:46:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 10:46:39,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:46:39,539 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:46:39,539 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:46:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:46:39,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1677402151, now seen corresponding path program 2 times [2019-10-02 10:46:39,540 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:46:39,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:46:39,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:46:39,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:46:39,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:46:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:46:40,174 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-02 10:46:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 10:46:40,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:46:40,394 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:46:40,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:46:40,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:46:40,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:46:40,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 76 conjunts are in the unsatisfiable core [2019-10-02 10:46:40,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:46:40,626 INFO L375 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 [2019-10-02 10:46:40,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:46:40,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:46:40,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:46:40,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-10-02 10:46:40,705 INFO L375 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 [2019-10-02 10:46:40,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:46:40,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:46:40,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:46:40,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-02 10:46:41,238 INFO L375 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 3 [2019-10-02 10:46:41,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:46:41,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:46:41,253 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_1|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_3|]} [2019-10-02 10:46:41,257 INFO L375 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 12 [2019-10-02 10:46:41,258 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:46:41,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:46:41,288 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:46:41,289 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2019-10-02 10:46:41,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:46:41,290 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:46:41,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:46:41,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:46:41,300 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:10 [2019-10-02 10:46:45,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:46:45,690 INFO L375 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 15 treesize of output 19 [2019-10-02 10:46:45,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:46:45,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:46:45,731 INFO L392 ElimStorePlain]: Different costs {4=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_30|], 10=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_30|]} [2019-10-02 10:46:45,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:46:45,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 27 [2019-10-02 10:46:45,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:46:45,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:46:45,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:46:45,824 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:46:45,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 140 [2019-10-02 10:46:45,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:46:45,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:46:45,827 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:46:45,899 INFO L567 ElimStorePlain]: treesize reduction 191, result has 22.7 percent of original size [2019-10-02 10:46:45,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:46:45,900 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:118, output treesize:82 [2019-10-02 10:46:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 10:46:46,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:46:46,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 40 [2019-10-02 10:46:46,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 10:46:46,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 10:46:46,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1456, Unknown=2, NotChecked=0, Total=1560 [2019-10-02 10:46:46,835 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 40 states. [2019-10-02 10:47:01,485 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-10-02 10:47:15,899 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-10-02 10:47:17,272 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-02 10:47:27,774 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-10-02 10:47:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:47:51,264 INFO L93 Difference]: Finished difference Result 391 states and 490 transitions. [2019-10-02 10:47:51,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 10:47:51,265 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-10-02 10:47:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:47:51,266 INFO L225 Difference]: With dead ends: 391 [2019-10-02 10:47:51,267 INFO L226 Difference]: Without dead ends: 384 [2019-10-02 10:47:51,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=306, Invalid=4378, Unknown=8, NotChecked=0, Total=4692 [2019-10-02 10:47:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-02 10:47:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 319. [2019-10-02 10:47:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-02 10:47:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 397 transitions. [2019-10-02 10:47:51,367 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 397 transitions. Word has length 76 [2019-10-02 10:47:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:47:51,368 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 397 transitions. [2019-10-02 10:47:51,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 10:47:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 397 transitions. [2019-10-02 10:47:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 10:47:51,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:47:51,377 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:47:51,377 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:47:51,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:47:51,378 INFO L82 PathProgramCache]: Analyzing trace with hash 135282332, now seen corresponding path program 1 times [2019-10-02 10:47:51,378 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:47:51,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:47:51,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:47:51,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:47:51,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:47:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:47:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 10:47:51,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:47:51,486 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:47:51,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:47:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:47:51,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 10:47:51,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:47:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 10:47:51,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:47:51,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-10-02 10:47:51,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 10:47:51,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 10:47:51,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-02 10:47:51,780 INFO L87 Difference]: Start difference. First operand 319 states and 397 transitions. Second operand 16 states. [2019-10-02 10:47:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:47:52,165 INFO L93 Difference]: Finished difference Result 429 states and 548 transitions. [2019-10-02 10:47:52,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 10:47:52,166 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2019-10-02 10:47:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:47:52,167 INFO L225 Difference]: With dead ends: 429 [2019-10-02 10:47:52,167 INFO L226 Difference]: Without dead ends: 352 [2019-10-02 10:47:52,168 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-10-02 10:47:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-10-02 10:47:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 336. [2019-10-02 10:47:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-02 10:47:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 419 transitions. [2019-10-02 10:47:52,280 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 419 transitions. Word has length 76 [2019-10-02 10:47:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:47:52,281 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 419 transitions. [2019-10-02 10:47:52,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 10:47:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 419 transitions. [2019-10-02 10:47:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 10:47:52,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:47:52,284 INFO L411 BasicCegarLoop]: trace histogram [10, 5, 4, 4, 4, 4, 4, 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] [2019-10-02 10:47:52,284 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:47:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:47:52,284 INFO L82 PathProgramCache]: Analyzing trace with hash 888697915, now seen corresponding path program 16 times [2019-10-02 10:47:52,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:47:52,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:47:52,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:47:52,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:47:52,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:47:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:47:52,827 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-02 10:47:54,078 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-10-02 10:47:54,347 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 70 [2019-10-02 10:47:54,608 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-10-02 10:47:54,861 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-10-02 10:47:55,067 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 54 [2019-10-02 10:47:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 10:47:55,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:47:55,476 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:47:55,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:47:55,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:47:55,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:47:55,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 126 conjunts are in the unsatisfiable core [2019-10-02 10:47:55,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:47:55,645 INFO L375 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 [2019-10-02 10:47:55,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:47:55,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:55,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:47:55,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 10:47:55,673 INFO L375 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 [2019-10-02 10:47:55,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:47:55,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:55,693 INFO L375 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 [2019-10-02 10:47:55,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:47:55,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:55,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:47:55,703 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-10-02 10:47:55,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:55,725 INFO L375 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 39 [2019-10-02 10:47:55,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:47:55,761 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-10-02 10:47:55,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:47:55,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2019-10-02 10:47:55,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:47:55,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:47:55,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:55,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:47:55,870 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:47:55,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:55,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:47:55,894 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2019-10-02 10:47:55,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:55,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-02 10:47:55,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:47:56,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:56,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:47:56,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2019-10-02 10:47:56,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-02 10:47:56,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:47:56,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:56,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:56,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 67 [2019-10-02 10:47:56,167 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:47:56,217 INFO L567 ElimStorePlain]: treesize reduction 48, result has 56.8 percent of original size [2019-10-02 10:47:56,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:47:56,218 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:80 [2019-10-02 10:47:56,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:47:56,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:56,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 134 [2019-10-02 10:47:56,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:47:56,560 INFO L567 ElimStorePlain]: treesize reduction 84, result has 54.8 percent of original size [2019-10-02 10:47:56,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:47:56,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 132 [2019-10-02 10:47:56,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,674 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:47:56,786 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-10-02 10:47:56,787 INFO L567 ElimStorePlain]: treesize reduction 56, result has 61.1 percent of original size [2019-10-02 10:47:56,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:47:56,791 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:101 [2019-10-02 10:47:56,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:56,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:47:57,543 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-10-02 10:47:57,787 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-10-02 10:47:58,046 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-02 10:47:58,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:47:59,905 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-10-02 10:47:59,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:48:00,368 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-10-02 10:48:00,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:00,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:48:00,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:48:01,282 WARN L191 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 300 [2019-10-02 10:48:01,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 10:48:03,279 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 316 [2019-10-02 10:48:03,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-10-02 10:48:05,548 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 590 [2019-10-02 10:48:05,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:05,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-10-02 10:48:05,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-10-02 10:48:11,267 WARN L191 SmtUtils]: Spent 4.66 s on a formula simplification that was a NOOP. DAG size: 1154 [2019-10-02 10:48:11,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 32 terms [2019-10-02 10:48:19,178 WARN L191 SmtUtils]: Spent 6.83 s on a formula simplification that was a NOOP. DAG size: 1158 [2019-10-02 10:48:19,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 32 terms [2019-10-02 10:48:27,358 WARN L191 SmtUtils]: Spent 6.88 s on a formula simplification that was a NOOP. DAG size: 1162 [2019-10-02 10:48:27,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 32 terms [2019-10-02 10:48:35,171 WARN L191 SmtUtils]: Spent 6.68 s on a formula simplification that was a NOOP. DAG size: 1166 [2019-10-02 10:48:35,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 32 terms [2019-10-02 10:48:43,256 WARN L191 SmtUtils]: Spent 6.91 s on a formula simplification that was a NOOP. DAG size: 1170 [2019-10-02 10:48:43,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 32 terms [2019-10-02 10:48:51,895 WARN L191 SmtUtils]: Spent 7.46 s on a formula simplification that was a NOOP. DAG size: 1170 [2019-10-02 10:48:59,485 WARN L191 SmtUtils]: Spent 6.40 s on a formula simplification that was a NOOP. DAG size: 1169 [2019-10-02 10:48:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 13 proven. 87 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 10:48:59,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:59,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 50 [2019-10-02 10:48:59,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 10:48:59,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 10:48:59,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2316, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 10:48:59,945 INFO L87 Difference]: Start difference. First operand 336 states and 419 transitions. Second operand 50 states. [2019-10-02 10:49:01,058 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-10-02 10:49:01,361 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-10-02 10:49:01,886 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-10-02 10:49:02,890 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-10-02 10:49:03,511 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 133 [2019-10-02 10:49:07,388 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-02 10:49:09,466 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-10-02 10:49:26,410 WARN L191 SmtUtils]: Spent 14.25 s on a formula simplification. DAG size of input: 1205 DAG size of output: 1172 [2019-10-02 10:49:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:49:27,235 INFO L93 Difference]: Finished difference Result 459 states and 587 transitions. [2019-10-02 10:49:27,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 10:49:27,236 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 74 [2019-10-02 10:49:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:49:27,238 INFO L225 Difference]: With dead ends: 459 [2019-10-02 10:49:27,238 INFO L226 Difference]: Without dead ends: 452 [2019-10-02 10:49:27,238 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 82.6s TimeCoverageRelationStatistics Valid=201, Invalid=3459, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 10:49:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-02 10:49:27,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 337. [2019-10-02 10:49:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-02 10:49:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 420 transitions. [2019-10-02 10:49:27,363 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 420 transitions. Word has length 74 [2019-10-02 10:49:27,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:49:27,364 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 420 transitions. [2019-10-02 10:49:27,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 10:49:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 420 transitions. [2019-10-02 10:49:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 10:49:27,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:49:27,366 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:49:27,367 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:49:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:49:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1846927575, now seen corresponding path program 3 times [2019-10-02 10:49:27,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:49:27,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:49:27,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:49:27,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:49:27,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:49:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:49:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 10:49:27,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:49:27,755 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:49:27,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:49:27,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 10:49:27,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:49:27,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 10:49:27,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:49:28,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 10:49:28,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:49:28,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 30 [2019-10-02 10:49:28,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 10:49:28,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 10:49:28,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2019-10-02 10:49:28,436 INFO L87 Difference]: Start difference. First operand 337 states and 420 transitions. Second operand 30 states. [2019-10-02 10:49:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:49:29,979 INFO L93 Difference]: Finished difference Result 452 states and 602 transitions. [2019-10-02 10:49:29,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 10:49:29,979 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2019-10-02 10:49:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:49:29,982 INFO L225 Difference]: With dead ends: 452 [2019-10-02 10:49:29,982 INFO L226 Difference]: Without dead ends: 446 [2019-10-02 10:49:29,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=228, Invalid=1934, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 10:49:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-02 10:49:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 380. [2019-10-02 10:49:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-02 10:49:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 496 transitions. [2019-10-02 10:49:30,118 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 496 transitions. Word has length 77 [2019-10-02 10:49:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:49:30,118 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 496 transitions. [2019-10-02 10:49:30,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 10:49:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 496 transitions. [2019-10-02 10:49:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 10:49:30,121 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:49:30,121 INFO L411 BasicCegarLoop]: trace histogram [11, 5, 4, 4, 4, 4, 4, 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] [2019-10-02 10:49:30,121 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:49:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:49:30,122 INFO L82 PathProgramCache]: Analyzing trace with hash -208349003, now seen corresponding path program 17 times [2019-10-02 10:49:30,122 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:49:30,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:49:30,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:49:30,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:49:30,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:49:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:49:30,641 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-10-02 10:49:30,995 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-10-02 10:49:31,164 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-10-02 10:49:31,338 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-10-02 10:49:31,507 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-10-02 10:49:31,707 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 59 [2019-10-02 10:49:31,910 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-10-02 10:49:32,499 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-10-02 10:49:32,766 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-10-02 10:49:33,079 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2019-10-02 10:49:33,392 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 79 [2019-10-02 10:49:33,718 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-10-02 10:49:34,056 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2019-10-02 10:49:34,321 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 62 [2019-10-02 10:49:34,601 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 61 [2019-10-02 10:49:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 10:49:34,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:49:34,653 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:49:34,780 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 10:49:34,861 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-02 10:49:34,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:49:34,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 102 conjunts are in the unsatisfiable core [2019-10-02 10:49:34,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:49:34,872 INFO L375 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 [2019-10-02 10:49:34,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:34,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:34,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:34,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 10:49:34,987 INFO L375 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 [2019-10-02 10:49:34,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:35,009 INFO L375 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 [2019-10-02 10:49:35,010 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:35,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,018 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-10-02 10:49:35,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:35,176 INFO L375 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 39 [2019-10-02 10:49:35,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,218 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-10-02 10:49:35,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2019-10-02 10:49:35,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:49:35,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:35,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:49:35,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:35,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,435 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2019-10-02 10:49:35,602 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:35,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-02 10:49:35,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,669 INFO L567 ElimStorePlain]: treesize reduction 40, result has 65.2 percent of original size [2019-10-02 10:49:35,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:75 [2019-10-02 10:49:35,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:35,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 72 [2019-10-02 10:49:35,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,890 INFO L567 ElimStorePlain]: treesize reduction 48, result has 64.2 percent of original size [2019-10-02 10:49:35,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:35,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-02 10:49:35,895 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:35,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:35,926 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:107 [2019-10-02 10:49:36,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:36,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-02 10:49:36,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:115, output treesize:107 [2019-10-02 10:49:36,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 124 [2019-10-02 10:49:36,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:36,291 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:36,390 INFO L567 ElimStorePlain]: treesize reduction 96, result has 45.8 percent of original size [2019-10-02 10:49:36,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:36,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:36,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:36,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2019-10-02 10:49:36,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,434 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:135 [2019-10-02 10:49:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 10:49:40,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:49:40,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 47 [2019-10-02 10:49:40,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-02 10:49:40,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-02 10:49:40,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 10:49:40,733 INFO L87 Difference]: Start difference. First operand 380 states and 496 transitions. Second operand 47 states. [2019-10-02 10:49:41,636 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 61 [2019-10-02 10:49:41,895 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-10-02 10:49:42,337 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 60 [2019-10-02 10:49:43,117 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-02 10:49:43,587 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2019-10-02 10:49:44,904 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-10-02 10:49:45,318 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-10-02 10:49:46,704 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-10-02 10:49:48,559 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 112 [2019-10-02 10:49:48,898 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2019-10-02 10:49:49,311 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2019-10-02 10:49:49,706 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 116 [2019-10-02 10:49:50,215 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 122 [2019-10-02 10:49:50,607 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2019-10-02 10:49:50,964 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 99 [2019-10-02 10:49:51,384 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 105 [2019-10-02 10:49:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:49:51,728 INFO L93 Difference]: Finished difference Result 501 states and 691 transitions. [2019-10-02 10:49:51,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 10:49:51,728 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 75 [2019-10-02 10:49:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:49:51,731 INFO L225 Difference]: With dead ends: 501 [2019-10-02 10:49:51,731 INFO L226 Difference]: Without dead ends: 470 [2019-10-02 10:49:51,732 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 11 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=233, Invalid=4189, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 10:49:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-02 10:49:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 331. [2019-10-02 10:49:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-10-02 10:49:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 437 transitions. [2019-10-02 10:49:51,804 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 437 transitions. Word has length 75 [2019-10-02 10:49:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:49:51,805 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 437 transitions. [2019-10-02 10:49:51,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-02 10:49:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 437 transitions. [2019-10-02 10:49:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 10:49:51,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:49:51,807 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 3, 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] [2019-10-02 10:49:51,807 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:49:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:49:51,808 INFO L82 PathProgramCache]: Analyzing trace with hash -797137357, now seen corresponding path program 3 times [2019-10-02 10:49:51,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:49:51,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:49:51,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:49:51,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:49:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:49:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:49:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 10:49:52,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:49:52,658 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:49:52,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:49:52,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-02 10:49:52,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:49:52,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 101 conjunts are in the unsatisfiable core [2019-10-02 10:49:52,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:49:52,861 INFO L375 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 [2019-10-02 10:49:52,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-10-02 10:49:52,892 INFO L375 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 [2019-10-02 10:49:52,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-02 10:49:52,931 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,932 INFO L375 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 39 [2019-10-02 10:49:52,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,965 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-10-02 10:49:52,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:29 [2019-10-02 10:49:53,016 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_64|], 1=[|v_#memory_$Pointer$.base_70|]} [2019-10-02 10:49:53,020 INFO L375 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 [2019-10-02 10:49:53,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,045 INFO L375 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 20 treesize of output 19 [2019-10-02 10:49:53,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,075 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2019-10-02 10:49:53,180 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-02 10:49:53,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,243 INFO L567 ElimStorePlain]: treesize reduction 40, result has 61.9 percent of original size [2019-10-02 10:49:53,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:65 [2019-10-02 10:49:53,314 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_65|], 3=[|v_#memory_$Pointer$.base_71|]} [2019-10-02 10:49:53,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:49:53,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 66 [2019-10-02 10:49:53,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,450 INFO L567 ElimStorePlain]: treesize reduction 75, result has 49.0 percent of original size [2019-10-02 10:49:53,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:93 [2019-10-02 10:49:53,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:53,548 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-02 10:49:53,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:93 [2019-10-02 10:49:53,657 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.offset_66|], 6=[|v_#memory_$Pointer$.base_72|]} [2019-10-02 10:49:53,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:53,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-02 10:49:53,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 118 [2019-10-02 10:49:53,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,782 INFO L496 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:53,921 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 35 [2019-10-02 10:49:53,921 INFO L567 ElimStorePlain]: treesize reduction 700, result has 11.7 percent of original size [2019-10-02 10:49:53,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:112, output treesize:117 [2019-10-02 10:49:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 50 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 10:49:55,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:49:55,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 39 [2019-10-02 10:49:55,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-02 10:49:55,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-02 10:49:55,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1382, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 10:49:55,362 INFO L87 Difference]: Start difference. First operand 331 states and 437 transitions. Second operand 39 states. [2019-10-02 10:49:56,245 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-10-02 10:49:56,518 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 51 [2019-10-02 10:49:56,767 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-10-02 10:49:57,036 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 56 [2019-10-02 10:49:57,297 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2019-10-02 10:49:57,646 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 84 [2019-10-02 10:49:57,972 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 90 [2019-10-02 10:49:58,320 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 100 [2019-10-02 10:49:58,730 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 118 [2019-10-02 10:50:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:50:00,503 INFO L93 Difference]: Finished difference Result 377 states and 501 transitions. [2019-10-02 10:50:00,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 10:50:00,504 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-10-02 10:50:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:50:00,507 INFO L225 Difference]: With dead ends: 377 [2019-10-02 10:50:00,507 INFO L226 Difference]: Without dead ends: 370 [2019-10-02 10:50:00,508 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=370, Invalid=2822, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 10:50:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-10-02 10:50:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 316. [2019-10-02 10:50:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-10-02 10:50:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 413 transitions. [2019-10-02 10:50:00,586 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 413 transitions. Word has length 75 [2019-10-02 10:50:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:50:00,586 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 413 transitions. [2019-10-02 10:50:00,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-02 10:50:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 413 transitions. [2019-10-02 10:50:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 10:50:00,589 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:50:00,589 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:50:00,589 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:50:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:50:00,589 INFO L82 PathProgramCache]: Analyzing trace with hash -568000615, now seen corresponding path program 4 times [2019-10-02 10:50:00,590 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:50:00,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:50:00,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:50:00,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:50:00,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:50:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:50:02,273 WARN L191 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-10-02 10:50:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 10:50:02,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:50:02,907 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:50:03,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:50:03,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:50:03,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:50:03,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-02 10:50:03,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:50:03,110 INFO L375 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 [2019-10-02 10:50:03,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:03,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 10:50:03,180 INFO L375 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 [2019-10-02 10:50:03,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:03,194 INFO L375 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 [2019-10-02 10:50:03,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:03,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,203 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-10-02 10:50:03,271 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:03,272 INFO L375 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 15 [2019-10-02 10:50:03,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:03,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-10-02 10:50:03,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:50:03,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:03,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:50:03,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:03,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,391 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-10-02 10:50:59,044 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-02 10:50:59,045 INFO L341 Elim1Store]: treesize reduction 38, result has 77.6 percent of original size [2019-10-02 10:50:59,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 166 [2019-10-02 10:50:59,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,185 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:59,376 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-02 10:50:59,376 INFO L567 ElimStorePlain]: treesize reduction 67, result has 67.0 percent of original size [2019-10-02 10:50:59,556 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-10-02 10:50:59,557 INFO L341 Elim1Store]: treesize reduction 38, result has 76.5 percent of original size [2019-10-02 10:50:59,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 140 [2019-10-02 10:50:59,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:59,729 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-10-02 10:50:59,730 INFO L567 ElimStorePlain]: treesize reduction 78, result has 58.1 percent of original size [2019-10-02 10:50:59,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:59,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:125 [2019-10-02 10:50:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:59,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:59,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:01,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:01,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:01,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:01,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:01,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:01,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:01,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:01,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:04,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:04,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:04,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:04,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:06,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:06,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:06,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:06,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:06,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:06,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:06,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:06,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:10,059 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 142 DAG size of output: 123 [2019-10-02 10:51:13,093 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 233 [2019-10-02 10:51:19,036 WARN L191 SmtUtils]: Spent 3.58 s on a formula simplification that was a NOOP. DAG size: 246 [2019-10-02 10:51:19,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-10-02 10:51:23,657 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 250 [2019-10-02 10:51:23,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-10-02 10:51:30,874 WARN L191 SmtUtils]: Spent 4.80 s on a formula simplification that was a NOOP. DAG size: 267 [2019-10-02 10:51:30,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 18 terms [2019-10-02 10:51:37,746 WARN L191 SmtUtils]: Spent 4.26 s on a formula simplification that was a NOOP. DAG size: 479 [2019-10-02 10:51:37,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 18 terms [2019-10-02 10:52:09,403 WARN L191 SmtUtils]: Spent 29.03 s on a formula simplification. DAG size of input: 501 DAG size of output: 499 [2019-10-02 10:52:41,050 WARN L191 SmtUtils]: Spent 28.65 s on a formula simplification. DAG size of input: 914 DAG size of output: 911 [2019-10-02 10:52:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 10:52:41,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:52:41,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2019-10-02 10:52:41,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 10:52:41,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 10:52:41,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2096, Unknown=35, NotChecked=0, Total=2256 [2019-10-02 10:52:41,280 INFO L87 Difference]: Start difference. First operand 316 states and 413 transitions. Second operand 48 states.