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-ext2-properties/simple_search_value-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:02:06,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:02:06,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:02:06,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:02:06,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:02:06,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:02:06,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:02:06,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:02:06,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:02:06,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:02:06,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:02:06,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:02:06,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:02:06,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:02:06,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:02:06,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:02:06,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:02:06,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:02:06,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:02:06,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:02:06,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:02:06,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:02:06,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:02:06,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:02:06,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:02:06,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:02:06,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:02:06,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:02:06,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:02:06,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:02:06,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:02:06,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:02:06,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:02:06,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:02:06,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:02:06,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:02:06,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:02:06,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:02:06,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:02:06,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:02:06,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:02:06,123 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-09-20 13:02:06,138 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:02:06,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:02:06,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:02:06,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:02:06,139 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:02:06,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:02:06,140 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:02:06,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:02:06,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:02:06,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:02:06,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:02:06,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:02:06,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:02:06,141 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:02:06,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:02:06,142 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:02:06,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:02:06,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:02:06,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:02:06,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:02:06,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:02:06,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:02:06,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:02:06,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:02:06,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:02:06,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:02:06,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:02:06,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:02:06,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:02:06,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:02:06,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:02:06,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:02:06,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:02:06,190 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:02:06,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2019-09-20 13:02:06,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baab35316/982758879173411eb0d11fc3467609f9/FLAG670353762 [2019-09-20 13:02:06,826 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:02:06,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2019-09-20 13:02:06,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baab35316/982758879173411eb0d11fc3467609f9/FLAG670353762 [2019-09-20 13:02:07,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baab35316/982758879173411eb0d11fc3467609f9 [2019-09-20 13:02:07,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:02:07,115 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:02:07,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:07,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:02:07,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:02:07,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:07" (1/1) ... [2019-09-20 13:02:07,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d3b3780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:07, skipping insertion in model container [2019-09-20 13:02:07,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:07" (1/1) ... [2019-09-20 13:02:07,132 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:02:07,191 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:02:07,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:07,606 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:02:07,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:07,712 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:02:07,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:07 WrapperNode [2019-09-20 13:02:07,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:07,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:02:07,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:02:07,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:02:07,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:07" (1/1) ... [2019-09-20 13:02:07,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:07" (1/1) ... [2019-09-20 13:02:07,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:07" (1/1) ... [2019-09-20 13:02:07,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:07" (1/1) ... [2019-09-20 13:02:07,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:07" (1/1) ... [2019-09-20 13:02:07,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:07" (1/1) ... [2019-09-20 13:02:07,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:07" (1/1) ... [2019-09-20 13:02:07,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:02:07,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:02:07,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:02:07,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:02:07,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:07" (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-09-20 13:02:07,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:02:07,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:02:07,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-20 13:02:07,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-20 13:02:07,835 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-20 13:02:07,835 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:02:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:02:07,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:02:07,837 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:02:07,837 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:02:07,837 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:02:07,838 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:02:07,838 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:02:07,838 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:02:07,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:02:07,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:02:07,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:02:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:02:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:02:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:02:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:02:07,841 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:02:07,841 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:02:07,841 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:02:07,841 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-20 13:02:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-20 13:02:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:02:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:02:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:02:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:02:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:02:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:02:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:02:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:02:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:02:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:02:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:02:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:02:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:02:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:02:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:02:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:02:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:02:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:02:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:02:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:02:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:02:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:02:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:02:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:02:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:02:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:02:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:02:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:02:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:02:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:02:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:02:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:02:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:02:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:02:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:02:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:02:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:02:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:02:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:02:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:02:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:02:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:02:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:02:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:02:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:02:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:02:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:02:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:02:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:02:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:02:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:02:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:02:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:02:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:02:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:02:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:02:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:02:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:02:07,858 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:02:07,858 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:02:07,858 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:02:07,859 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:02:07,859 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:02:07,859 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:02:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:02:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:02:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:02:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:02:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:02:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:02:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:02:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:02:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:02:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:02:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:02:07,862 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:02:07,862 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:02:07,862 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:02:07,862 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:02:07,862 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:02:07,862 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:02:07,862 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:02:07,863 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:02:07,863 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:02:07,863 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:02:07,863 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:02:07,863 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:02:07,863 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-20 13:02:07,863 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:02:07,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:02:07,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:02:07,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:02:07,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:02:07,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:02:07,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:02:07,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:02:07,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:02:08,194 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-20 13:02:08,375 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:02:08,376 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-20 13:02:08,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:08 BoogieIcfgContainer [2019-09-20 13:02:08,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:02:08,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:02:08,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:02:08,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:02:08,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:02:07" (1/3) ... [2019-09-20 13:02:08,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2912402e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:08, skipping insertion in model container [2019-09-20 13:02:08,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:07" (2/3) ... [2019-09-20 13:02:08,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2912402e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:08, skipping insertion in model container [2019-09-20 13:02:08,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:08" (3/3) ... [2019-09-20 13:02:08,386 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2019-09-20 13:02:08,397 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:02:08,406 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:02:08,424 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:02:08,454 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:02:08,455 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:02:08,455 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:02:08,455 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:02:08,455 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:02:08,456 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:02:08,456 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:02:08,456 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:02:08,456 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:02:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-09-20 13:02:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 13:02:08,482 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:08,483 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:08,485 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:08,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:08,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2052998842, now seen corresponding path program 1 times [2019-09-20 13:02:08,494 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:08,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:08,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:08,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:08,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:08,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:08,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:02:08,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:02:08,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:02:08,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:02:08,669 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-09-20 13:02:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:08,698 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-09-20 13:02:08,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:02:08,700 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-20 13:02:08,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:08,711 INFO L225 Difference]: With dead ends: 45 [2019-09-20 13:02:08,711 INFO L226 Difference]: Without dead ends: 22 [2019-09-20 13:02:08,716 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-09-20 13:02:08,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-20 13:02:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-20 13:02:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-20 13:02:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-20 13:02:08,766 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2019-09-20 13:02:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:08,767 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-20 13:02:08,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:02:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-20 13:02:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:02:08,768 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:08,768 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:08,769 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:08,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:08,770 INFO L82 PathProgramCache]: Analyzing trace with hash 702499287, now seen corresponding path program 1 times [2019-09-20 13:02:08,770 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:08,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:08,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:08,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:08,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:08,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:08,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:02:08,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:02:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:02:08,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:02:08,853 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2019-09-20 13:02:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:08,880 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-09-20 13:02:08,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:02:08,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-20 13:02:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:08,884 INFO L225 Difference]: With dead ends: 32 [2019-09-20 13:02:08,884 INFO L226 Difference]: Without dead ends: 23 [2019-09-20 13:02:08,886 INFO L636 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-09-20 13:02:08,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-20 13:02:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-20 13:02:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-20 13:02:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-20 13:02:08,894 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2019-09-20 13:02:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:08,895 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-20 13:02:08,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:02:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-20 13:02:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:02:08,896 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:08,896 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:08,897 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:08,897 INFO L82 PathProgramCache]: Analyzing trace with hash 759757589, now seen corresponding path program 1 times [2019-09-20 13:02:08,897 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:08,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:08,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:08,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:08,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:09,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:09,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:02:09,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:02:09,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:02:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:02:09,009 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-09-20 13:02:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:09,065 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-09-20 13:02:09,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:02:09,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-20 13:02:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:09,067 INFO L225 Difference]: With dead ends: 43 [2019-09-20 13:02:09,067 INFO L226 Difference]: Without dead ends: 28 [2019-09-20 13:02:09,067 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-20 13:02:09,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-09-20 13:02:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-20 13:02:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-20 13:02:09,073 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-09-20 13:02:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:09,073 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-20 13:02:09,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:02:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-20 13:02:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:02:09,074 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:09,075 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:09,075 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:09,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash 299645265, now seen corresponding path program 1 times [2019-09-20 13:02:09,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:09,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:09,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 13:02:09,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:09,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:02:09,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:02:09,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:02:09,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:02:09,164 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 4 states. [2019-09-20 13:02:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:09,242 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-09-20 13:02:09,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:02:09,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-20 13:02:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:09,244 INFO L225 Difference]: With dead ends: 36 [2019-09-20 13:02:09,244 INFO L226 Difference]: Without dead ends: 33 [2019-09-20 13:02:09,245 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-20 13:02:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-09-20 13:02:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-20 13:02:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-20 13:02:09,250 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-09-20 13:02:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:09,250 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-20 13:02:09,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:02:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-20 13:02:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:02:09,251 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:09,252 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:09,252 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:09,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1130545059, now seen corresponding path program 1 times [2019-09-20 13:02:09,252 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:09,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:09,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:09,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:09,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 13:02:09,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:09,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:02:09,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:02:09,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:02:09,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:09,347 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-09-20 13:02:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:09,409 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-20 13:02:09,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:02:09,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-09-20 13:02:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:09,410 INFO L225 Difference]: With dead ends: 37 [2019-09-20 13:02:09,410 INFO L226 Difference]: Without dead ends: 29 [2019-09-20 13:02:09,411 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:02:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-20 13:02:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-20 13:02:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-20 13:02:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-20 13:02:09,416 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2019-09-20 13:02:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:09,416 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-20 13:02:09,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:02:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-20 13:02:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:02:09,417 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:09,418 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:09,418 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1128698017, now seen corresponding path program 1 times [2019-09-20 13:02:09,418 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:09,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:09,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:09,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:09,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:09,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:09,469 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-09-20 13:02:09,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:09,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 13:02:09,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:09,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:09,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:09,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-20 13:02:09,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:02:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:02:09,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:02:09,661 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-09-20 13:02:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:09,735 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-09-20 13:02:09,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:02:09,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-20 13:02:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:09,736 INFO L225 Difference]: With dead ends: 54 [2019-09-20 13:02:09,737 INFO L226 Difference]: Without dead ends: 36 [2019-09-20 13:02:09,737 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:02:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-20 13:02:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-09-20 13:02:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-20 13:02:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-20 13:02:09,743 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2019-09-20 13:02:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:09,743 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-20 13:02:09,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:02:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-20 13:02:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:02:09,744 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:09,745 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:09,745 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:09,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:09,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1905192293, now seen corresponding path program 2 times [2019-09-20 13:02:09,745 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:09,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:09,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:09,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:09,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:09,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:09,843 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-09-20 13:02:09,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:02:09,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:02:09,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:09,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 13:02:09,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:09,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:09,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:09,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-20 13:02:09,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:02:09,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:02:09,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:02:09,997 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-09-20 13:02:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:10,132 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-09-20 13:02:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:02:10,133 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-20 13:02:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:10,134 INFO L225 Difference]: With dead ends: 59 [2019-09-20 13:02:10,134 INFO L226 Difference]: Without dead ends: 41 [2019-09-20 13:02:10,135 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:02:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-20 13:02:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-09-20 13:02:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-20 13:02:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-20 13:02:10,142 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-09-20 13:02:10,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:10,142 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-20 13:02:10,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:02:10,142 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-20 13:02:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:02:10,143 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:10,144 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:10,144 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1016458017, now seen corresponding path program 3 times [2019-09-20 13:02:10,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:10,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:10,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:10,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:10,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:10,223 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-09-20 13:02:10,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:02:10,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-20 13:02:10,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:10,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-20 13:02:10,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:10,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:10,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:10,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-20 13:02:10,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:02:10,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:02:10,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:02:10,464 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 8 states. [2019-09-20 13:02:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:10,591 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-09-20 13:02:10,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:02:10,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-09-20 13:02:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:10,593 INFO L225 Difference]: With dead ends: 64 [2019-09-20 13:02:10,593 INFO L226 Difference]: Without dead ends: 46 [2019-09-20 13:02:10,593 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:02:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-20 13:02:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-09-20 13:02:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-20 13:02:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-20 13:02:10,604 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2019-09-20 13:02:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:10,604 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-20 13:02:10,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:02:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-20 13:02:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 13:02:10,608 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:10,608 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:10,608 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1614029541, now seen corresponding path program 4 times [2019-09-20 13:02:10,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:10,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:10,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:10,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:10,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:10,731 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-09-20 13:02:10,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:02:10,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:02:10,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:10,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-20 13:02:10,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:10,919 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-09-20 13:02:10,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:10,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:10,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:10,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:10,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:10,988 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-09-20 13:02:10,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,020 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-09-20 13:02:11,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-09-20 13:02:11,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-20 13:02:11,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:49 [2019-09-20 13:02:11,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 99 [2019-09-20 13:02:11,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,268 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-09-20 13:02:11,297 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-09-20 13:02:11,298 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 66 treesize of output 40 [2019-09-20 13:02:11,299 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,340 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-09-20 13:02:11,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:44 [2019-09-20 13:02:11,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,449 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 82 [2019-09-20 13:02:11,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,527 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-09-20 13:02:11,528 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-09-20 13:02:11,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:110 [2019-09-20 13:02:11,695 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 189 [2019-09-20 13:02:11,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,800 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-20 13:02:11,800 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-09-20 13:02:11,869 INFO L341 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-09-20 13:02:11,870 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 143 treesize of output 95 [2019-09-20 13:02:11,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,880 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:11,966 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-09-20 13:02:11,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:11,969 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:97 [2019-09-20 13:02:12,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:12,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, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 161 [2019-09-20 13:02:12,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-09-20 13:02:12,242 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-20 13:02:12,242 INFO L567 ElimStorePlain]: treesize reduction 1061, result has 14.0 percent of original size [2019-09-20 13:02:12,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:12,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:188, output treesize:223 [2019-09-20 13:02:12,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:12,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 84 [2019-09-20 13:02:12,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:12,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:12,528 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-20 13:02:12,529 INFO L341 Elim1Store]: treesize reduction 72, result has 59.6 percent of original size [2019-09-20 13:02:12,530 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 227 treesize of output 155 [2019-09-20 13:02:12,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,557 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:12,696 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-20 13:02:12,696 INFO L567 ElimStorePlain]: treesize reduction 78, result has 49.0 percent of original size [2019-09-20 13:02:12,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:12,699 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:243, output treesize:147 [2019-09-20 13:02:12,865 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:12,866 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 245 [2019-09-20 13:02:12,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-09-20 13:02:13,114 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-20 13:02:13,114 INFO L567 ElimStorePlain]: treesize reduction 3660, result has 6.5 percent of original size [2019-09-20 13:02:13,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:13,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:274, output treesize:321 [2019-09-20 13:02:13,183 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_12|], 20=[|v_#memory_$Pointer$.base_20|]} [2019-09-20 13:02:13,189 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:13,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:13,671 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-09-20 13:02:13,672 INFO L341 Elim1Store]: treesize reduction 138, result has 68.2 percent of original size [2019-09-20 13:02:13,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 317 treesize of output 361 [2019-09-20 13:02:13,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:13,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 18 xjuncts. [2019-09-20 13:02:14,603 WARN L191 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-09-20 13:02:14,604 INFO L567 ElimStorePlain]: treesize reduction 29410, result has 1.1 percent of original size [2019-09-20 13:02:14,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:14,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:398, output treesize:291 [2019-09-20 13:02:14,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:14,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 295 treesize of output 215 [2019-09-20 13:02:14,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:14,829 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:14,900 INFO L567 ElimStorePlain]: treesize reduction 152, result has 22.8 percent of original size [2019-09-20 13:02:14,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:14,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:295, output treesize:4 [2019-09-20 13:02:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:14,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:14,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2019-09-20 13:02:14,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:02:14,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:02:14,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:02:14,960 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 21 states. [2019-09-20 13:02:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:16,287 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-09-20 13:02:16,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-20 13:02:16,287 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-20 13:02:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:16,289 INFO L225 Difference]: With dead ends: 75 [2019-09-20 13:02:16,289 INFO L226 Difference]: Without dead ends: 57 [2019-09-20 13:02:16,290 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-09-20 13:02:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-20 13:02:16,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-09-20 13:02:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-20 13:02:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-20 13:02:16,296 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 40 [2019-09-20 13:02:16,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:16,297 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-20 13:02:16,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:02:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-20 13:02:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:02:16,298 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:16,298 INFO L407 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:16,298 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:16,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash 128571999, now seen corresponding path program 5 times [2019-09-20 13:02:16,299 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:16,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:16,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:16,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:16,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:16,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:16,384 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-09-20 13:02:16,455 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-20 13:02:16,635 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-20 13:02:16,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:16,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 13:02:16,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:16,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:16,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:16,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-20 13:02:16,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:02:16,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:02:16,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:02:16,668 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2019-09-20 13:02:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:16,799 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-09-20 13:02:16,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:02:16,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-20 13:02:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:16,803 INFO L225 Difference]: With dead ends: 74 [2019-09-20 13:02:16,803 INFO L226 Difference]: Without dead ends: 56 [2019-09-20 13:02:16,804 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:02:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-20 13:02:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-09-20 13:02:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-20 13:02:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-20 13:02:16,820 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 45 [2019-09-20 13:02:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:16,821 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-20 13:02:16,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:02:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-20 13:02:16,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:02:16,825 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:16,826 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:16,826 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:16,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:16,827 INFO L82 PathProgramCache]: Analyzing trace with hash 806061979, now seen corresponding path program 6 times [2019-09-20 13:02:16,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:16,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:16,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:16,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:16,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:17,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:17,042 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-09-20 13:02:17,195 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-20 13:02:17,749 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-20 13:02:17,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:17,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 13:02:17,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:17,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:02:17,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:17,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-20 13:02:17,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:02:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:02:17,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:02:17,804 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 11 states. [2019-09-20 13:02:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:18,060 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-09-20 13:02:18,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:02:18,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-09-20 13:02:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:18,063 INFO L225 Difference]: With dead ends: 79 [2019-09-20 13:02:18,068 INFO L226 Difference]: Without dead ends: 61 [2019-09-20 13:02:18,069 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:02:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-20 13:02:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-09-20 13:02:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-20 13:02:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-20 13:02:18,088 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 50 [2019-09-20 13:02:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:18,089 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-20 13:02:18,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:02:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-20 13:02:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:02:18,093 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:18,093 INFO L407 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:18,093 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:18,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:18,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1190084641, now seen corresponding path program 7 times [2019-09-20 13:02:18,094 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:18,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:18,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:18,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:18,359 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-09-20 13:02:18,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:18,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 13:02:18,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:18,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:18,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:18,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-20 13:02:18,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:02:18,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:02:18,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:02:18,673 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 12 states. [2019-09-20 13:02:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:18,945 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-20 13:02:18,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 13:02:18,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-20 13:02:18,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:18,949 INFO L225 Difference]: With dead ends: 84 [2019-09-20 13:02:18,949 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 13:02:18,955 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:02:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 13:02:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-09-20 13:02:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-20 13:02:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-20 13:02:18,964 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 55 [2019-09-20 13:02:18,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:18,964 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-20 13:02:18,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:02:18,965 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-20 13:02:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:02:18,972 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:18,972 INFO L407 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:18,972 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:18,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:18,973 INFO L82 PathProgramCache]: Analyzing trace with hash 244847131, now seen corresponding path program 8 times [2019-09-20 13:02:18,973 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:18,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:18,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:19,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:19,234 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-09-20 13:02:19,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:02:19,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:02:19,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:19,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-20 13:02:19,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:19,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:19,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:19,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-20 13:02:19,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:02:19,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:02:19,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:02:19,552 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 13 states. [2019-09-20 13:02:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:19,834 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-09-20 13:02:19,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-20 13:02:19,835 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-20 13:02:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:19,836 INFO L225 Difference]: With dead ends: 89 [2019-09-20 13:02:19,837 INFO L226 Difference]: Without dead ends: 71 [2019-09-20 13:02:19,838 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:02:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-20 13:02:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-09-20 13:02:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-20 13:02:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-20 13:02:19,859 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 60 [2019-09-20 13:02:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:19,860 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-20 13:02:19,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:02:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-20 13:02:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:02:19,862 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:19,862 INFO L407 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:19,863 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1765197151, now seen corresponding path program 9 times [2019-09-20 13:02:19,864 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:19,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:19,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:19,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:19,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:20,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:20,102 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-09-20 13:02:20,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:02:21,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-20 13:02:21,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:21,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-20 13:02:21,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:21,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:21,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:21,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-20 13:02:21,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:02:21,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:02:21,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:02:21,691 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 14 states. [2019-09-20 13:02:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:21,918 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-09-20 13:02:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 13:02:21,919 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-09-20 13:02:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:21,920 INFO L225 Difference]: With dead ends: 94 [2019-09-20 13:02:21,920 INFO L226 Difference]: Without dead ends: 76 [2019-09-20 13:02:21,921 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2019-09-20 13:02:21,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-20 13:02:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-09-20 13:02:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-20 13:02:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-20 13:02:21,927 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 65 [2019-09-20 13:02:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:21,927 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-20 13:02:21,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:02:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-20 13:02:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-20 13:02:21,928 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:21,928 INFO L407 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:21,928 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:21,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:21,929 INFO L82 PathProgramCache]: Analyzing trace with hash -388399973, now seen corresponding path program 10 times [2019-09-20 13:02:21,929 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:21,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:21,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:21,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:21,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-20 13:02:22,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:22,487 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-09-20 13:02:22,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:02:22,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:02:22,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:22,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-20 13:02:22,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:22,785 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-09-20 13:02:22,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:22,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:22,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:22,850 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-09-20 13:02:22,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,898 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-09-20 13:02:22,906 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-09-20 13:02:22,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:22,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,923 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-09-20 13:02:22,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,964 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 27 treesize of output 11 [2019-09-20 13:02:22,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:22,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-09-20 13:02:23,036 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:23,036 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 22 treesize of output 69 [2019-09-20 13:02:23,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,085 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-09-20 13:02:23,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-09-20 13:02:23,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:23,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-09-20 13:02:23,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:02:23,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:23,172 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-09-20 13:02:23,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-09-20 13:02:23,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:23,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 99 [2019-09-20 13:02:23,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,336 INFO L567 ElimStorePlain]: treesize reduction 42, result has 61.1 percent of original size [2019-09-20 13:02:23,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-09-20 13:02:23,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:23,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:23,370 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:55 [2019-09-20 13:02:23,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:02:23,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:23,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:23,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:55 [2019-09-20 13:02:23,609 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:23,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 129 [2019-09-20 13:02:23,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,781 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-20 13:02:23,782 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2019-09-20 13:02:23,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 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-09-20 13:02:23,795 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,914 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-20 13:02:23,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:23,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:23,916 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2019-09-20 13:02:24,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:02:24,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:24,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:76 [2019-09-20 13:02:24,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 159 [2019-09-20 13:02:24,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,372 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-20 13:02:24,372 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.5 percent of original size [2019-09-20 13:02:24,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 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-09-20 13:02:24,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:24,443 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:101 [2019-09-20 13:02:24,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:02:24,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:24,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:120, output treesize:101 [2019-09-20 13:02:24,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 189 [2019-09-20 13:02:24,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:25,020 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-20 13:02:25,021 INFO L567 ElimStorePlain]: treesize reduction 84, result has 62.7 percent of original size [2019-09-20 13:02:25,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 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-09-20 13:02:25,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:25,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:25,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:25,113 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:130 [2019-09-20 13:02:25,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, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:02:25,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:25,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:25,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:25,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:149, output treesize:130 [2019-09-20 13:02:29,330 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-20 13:02:29,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 47 treesize of output 219 [2019-09-20 13:02:29,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,679 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-20 13:02:29,680 INFO L567 ElimStorePlain]: treesize reduction 98, result has 64.0 percent of original size [2019-09-20 13:02:29,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 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-09-20 13:02:29,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,812 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-20 13:02:29,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:29,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:152, output treesize:163 [2019-09-20 13:02:30,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:02:30,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,156 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-20 13:02:30,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:30,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:182, output treesize:163 [2019-09-20 13:02:38,129 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-09-20 13:02:38,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:38,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 52 treesize of output 249 [2019-09-20 13:02:38,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:38,589 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2019-09-20 13:02:38,589 INFO L567 ElimStorePlain]: treesize reduction 112, result has 65.3 percent of original size [2019-09-20 13:02:38,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, 15 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-09-20 13:02:38,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:38,764 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-20 13:02:38,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:38,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:38,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:185, output treesize:200 [2019-09-20 13:02:41,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:02:41,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:41,939 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-09-20 13:02:41,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:41,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:41,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:219, output treesize:200