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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:59:53,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:59:53,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:59:53,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:59:53,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:59:53,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:59:53,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:59:53,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:59:53,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:59:53,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:59:53,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:59:53,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:59:53,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:59:53,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:59:53,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:59:53,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:59:53,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:59:53,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:59:53,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:59:53,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:59:53,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:59:53,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:59:53,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:59:53,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:59:53,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:59:53,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:59:53,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:59:53,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:59:53,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:59:53,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:59:53,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:59:53,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:59:53,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:59:53,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:59:53,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:59:53,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:59:53,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:59:53,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:59:53,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:59:53,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:59:53,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:59:53,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:59:53,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:59:53,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:59:53,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:59:53,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:59:53,555 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:59:53,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:59:53,556 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:59:53,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:59:53,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:59:53,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:59:53,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:59:53,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:59:53,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:59:53,557 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:59:53,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:59:53,557 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:59:53,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:59:53,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:59:53,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:59:53,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:59:53,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:59:53,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:59:53,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:59:53,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:59:53,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:59:53,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:59:53,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:59:53,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:59:53,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 01:59:53,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:59:53,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:59:53,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:59:53,870 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:59:53,871 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:59:53,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i [2019-10-15 01:59:53,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db77a294d/9feac498109642bdbdc1384ee800b65d/FLAG483ae53c0 [2019-10-15 01:59:54,513 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:59:54,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i [2019-10-15 01:59:54,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db77a294d/9feac498109642bdbdc1384ee800b65d/FLAG483ae53c0 [2019-10-15 01:59:54,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db77a294d/9feac498109642bdbdc1384ee800b65d [2019-10-15 01:59:54,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:59:54,786 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:59:54,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:59:54,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:59:54,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:59:54,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:59:54" (1/1) ... [2019-10-15 01:59:54,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb581f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:54, skipping insertion in model container [2019-10-15 01:59:54,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:59:54" (1/1) ... [2019-10-15 01:59:54,801 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:59:54,846 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:59:55,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:59:55,447 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:59:55,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:59:55,648 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:59:55,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:55 WrapperNode [2019-10-15 01:59:55,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:59:55,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:59:55,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:59:55,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:59:55,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:55" (1/1) ... [2019-10-15 01:59:55,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:55" (1/1) ... [2019-10-15 01:59:55,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:55" (1/1) ... [2019-10-15 01:59:55,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:55" (1/1) ... [2019-10-15 01:59:55,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:55" (1/1) ... [2019-10-15 01:59:55,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:55" (1/1) ... [2019-10-15 01:59:55,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:55" (1/1) ... [2019-10-15 01:59:55,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:59:55,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:59:55,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:59:55,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:59:55,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:59:55,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:59:55,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:59:55,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-15 01:59:55,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-15 01:59:55,859 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-10-15 01:59:55,859 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2019-10-15 01:59:55,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-10-15 01:59:55,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2019-10-15 01:59:55,860 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2019-10-15 01:59:55,860 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2019-10-15 01:59:55,860 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2019-10-15 01:59:55,860 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2019-10-15 01:59:55,861 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2019-10-15 01:59:55,861 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2019-10-15 01:59:55,861 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2019-10-15 01:59:55,861 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2019-10-15 01:59:55,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:59:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:59:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-15 01:59:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-15 01:59:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 01:59:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 01:59:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 01:59:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 01:59:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 01:59:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 01:59:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 01:59:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 01:59:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 01:59:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 01:59:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 01:59:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 01:59:55,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 01:59:55,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 01:59:55,865 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 01:59:55,865 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 01:59:55,865 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 01:59:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 01:59:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 01:59:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 01:59:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 01:59:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 01:59:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 01:59:55,867 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 01:59:55,867 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 01:59:55,867 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 01:59:55,867 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 01:59:55,867 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 01:59:55,867 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 01:59:55,868 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 01:59:55,868 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 01:59:55,868 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 01:59:55,868 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 01:59:55,868 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 01:59:55,868 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 01:59:55,869 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 01:59:55,869 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 01:59:55,869 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 01:59:55,869 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 01:59:55,869 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 01:59:55,870 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 01:59:55,870 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 01:59:55,870 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 01:59:55,870 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 01:59:55,870 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 01:59:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 01:59:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 01:59:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 01:59:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 01:59:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 01:59:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:59:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 01:59:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 01:59:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:59:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 01:59:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 01:59:55,873 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 01:59:55,873 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 01:59:55,873 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 01:59:55,873 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 01:59:55,873 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 01:59:55,873 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:59:55,874 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 01:59:55,874 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 01:59:55,874 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 01:59:55,874 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 01:59:55,874 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 01:59:55,874 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 01:59:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 01:59:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 01:59:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 01:59:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 01:59:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 01:59:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 01:59:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 01:59:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 01:59:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 01:59:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 01:59:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 01:59:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 01:59:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 01:59:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 01:59:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 01:59:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 01:59:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 01:59:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 01:59:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 01:59:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 01:59:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 01:59:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 01:59:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 01:59:55,878 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 01:59:55,878 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 01:59:55,878 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 01:59:55,878 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 01:59:55,878 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 01:59:55,878 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 01:59:55,878 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 01:59:55,879 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 01:59:55,879 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 01:59:55,879 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2019-10-15 01:59:55,879 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2019-10-15 01:59:55,879 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2019-10-15 01:59:55,879 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2019-10-15 01:59:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2019-10-15 01:59:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2019-10-15 01:59:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2019-10-15 01:59:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2019-10-15 01:59:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2019-10-15 01:59:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2019-10-15 01:59:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2019-10-15 01:59:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2019-10-15 01:59:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2019-10-15 01:59:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2019-10-15 01:59:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2019-10-15 01:59:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2019-10-15 01:59:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2019-10-15 01:59:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2019-10-15 01:59:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2019-10-15 01:59:55,883 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2019-10-15 01:59:55,883 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2019-10-15 01:59:55,883 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2019-10-15 01:59:55,883 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2019-10-15 01:59:55,883 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2019-10-15 01:59:55,883 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2019-10-15 01:59:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2019-10-15 01:59:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-10-15 01:59:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2019-10-15 01:59:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2019-10-15 01:59:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2019-10-15 01:59:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2019-10-15 01:59:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2019-10-15 01:59:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2019-10-15 01:59:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2019-10-15 01:59:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2019-10-15 01:59:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2019-10-15 01:59:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2019-10-15 01:59:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2019-10-15 01:59:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:59:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-10-15 01:59:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2019-10-15 01:59:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2019-10-15 01:59:55,887 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2019-10-15 01:59:55,887 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-15 01:59:55,887 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2019-10-15 01:59:55,887 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2019-10-15 01:59:55,887 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2019-10-15 01:59:55,887 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2019-10-15 01:59:55,888 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2019-10-15 01:59:55,888 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2019-10-15 01:59:55,888 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2019-10-15 01:59:55,888 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2019-10-15 01:59:55,888 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2019-10-15 01:59:55,888 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2019-10-15 01:59:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2019-10-15 01:59:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2019-10-15 01:59:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2019-10-15 01:59:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2019-10-15 01:59:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2019-10-15 01:59:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2019-10-15 01:59:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2019-10-15 01:59:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2019-10-15 01:59:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2019-10-15 01:59:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2019-10-15 01:59:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2019-10-15 01:59:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2019-10-15 01:59:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2019-10-15 01:59:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2019-10-15 01:59:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2019-10-15 01:59:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2019-10-15 01:59:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2019-10-15 01:59:55,891 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2019-10-15 01:59:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2019-10-15 01:59:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-15 01:59:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2019-10-15 01:59:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2019-10-15 01:59:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2019-10-15 01:59:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2019-10-15 01:59:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2019-10-15 01:59:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2019-10-15 01:59:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2019-10-15 01:59:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2019-10-15 01:59:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2019-10-15 01:59:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2019-10-15 01:59:55,894 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2019-10-15 01:59:55,894 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2019-10-15 01:59:55,894 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2019-10-15 01:59:55,894 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2019-10-15 01:59:55,894 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2019-10-15 01:59:55,894 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2019-10-15 01:59:55,895 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2019-10-15 01:59:55,895 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2019-10-15 01:59:55,895 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2019-10-15 01:59:55,895 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2019-10-15 01:59:55,895 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2019-10-15 01:59:55,895 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2019-10-15 01:59:55,895 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2019-10-15 01:59:55,896 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2019-10-15 01:59:55,896 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2019-10-15 01:59:55,896 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2019-10-15 01:59:55,896 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2019-10-15 01:59:55,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:59:55,896 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-10-15 01:59:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2019-10-15 01:59:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:59:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-10-15 01:59:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:59:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2019-10-15 01:59:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2019-10-15 01:59:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2019-10-15 01:59:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2019-10-15 01:59:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:59:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:59:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2019-10-15 01:59:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2019-10-15 01:59:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:59:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2019-10-15 01:59:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:59:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2019-10-15 01:59:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2019-10-15 01:59:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:59:55,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:59:55,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:59:55,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 01:59:55,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:59:56,870 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:59:56,871 INFO L284 CfgBuilder]: Removed 41 assume(true) statements. [2019-10-15 01:59:56,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:59:56 BoogieIcfgContainer [2019-10-15 01:59:56,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:59:56,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:59:56,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:59:56,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:59:56,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:59:54" (1/3) ... [2019-10-15 01:59:56,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f0a3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:59:56, skipping insertion in model container [2019-10-15 01:59:56,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:55" (2/3) ... [2019-10-15 01:59:56,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f0a3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:59:56, skipping insertion in model container [2019-10-15 01:59:56,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:59:56" (3/3) ... [2019-10-15 01:59:56,884 INFO L109 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2019-10-15 01:59:56,896 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:59:56,907 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:59:56,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:59:56,950 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:59:56,953 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:59:56,953 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:59:56,953 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:59:56,955 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:59:56,955 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:59:56,955 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:59:56,956 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:59:56,985 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2019-10-15 01:59:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:59:56,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:56,997 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:57,001 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:57,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2063377772, now seen corresponding path program 1 times [2019-10-15 01:59:57,020 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:57,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174732845] [2019-10-15 01:59:57,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:57,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:57,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:57,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174732845] [2019-10-15 01:59:57,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:57,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:59:57,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996642756] [2019-10-15 01:59:57,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:59:57,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:57,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:59:57,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:59:57,228 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 2 states. [2019-10-15 01:59:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:57,310 INFO L93 Difference]: Finished difference Result 258 states and 425 transitions. [2019-10-15 01:59:57,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:59:57,312 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-15 01:59:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:57,327 INFO L225 Difference]: With dead ends: 258 [2019-10-15 01:59:57,327 INFO L226 Difference]: Without dead ends: 120 [2019-10-15 01:59:57,335 INFO L600 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-10-15 01:59:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-15 01:59:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-10-15 01:59:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-15 01:59:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2019-10-15 01:59:57,394 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 13 [2019-10-15 01:59:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:57,394 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2019-10-15 01:59:57,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:59:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2019-10-15 01:59:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:59:57,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:57,396 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:57,396 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1695892571, now seen corresponding path program 1 times [2019-10-15 01:59:57,397 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:57,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037138429] [2019-10-15 01:59:57,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:57,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:57,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:57,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037138429] [2019-10-15 01:59:57,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:57,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:59:57,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258483253] [2019-10-15 01:59:57,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:59:57,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:57,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:59:57,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:59:57,607 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand 5 states. [2019-10-15 01:59:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:57,795 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-10-15 01:59:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:59:57,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-15 01:59:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:57,799 INFO L225 Difference]: With dead ends: 122 [2019-10-15 01:59:57,799 INFO L226 Difference]: Without dead ends: 119 [2019-10-15 01:59:57,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:59:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-15 01:59:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-10-15 01:59:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-15 01:59:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2019-10-15 01:59:57,823 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 28 [2019-10-15 01:59:57,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:57,828 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2019-10-15 01:59:57,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:59:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2019-10-15 01:59:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:59:57,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:57,831 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:57,831 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:57,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:57,833 INFO L82 PathProgramCache]: Analyzing trace with hash 368229990, now seen corresponding path program 1 times [2019-10-15 01:59:57,834 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:57,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332504214] [2019-10-15 01:59:57,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:57,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:57,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:59:58,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332504214] [2019-10-15 01:59:58,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:59:58,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:59:58,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83337237] [2019-10-15 01:59:58,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:59:58,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:59:58,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:59:58,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:59:58,240 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand 13 states. [2019-10-15 01:59:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:59:59,372 INFO L93 Difference]: Finished difference Result 217 states and 259 transitions. [2019-10-15 01:59:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:59:59,372 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-10-15 01:59:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:59:59,377 INFO L225 Difference]: With dead ends: 217 [2019-10-15 01:59:59,377 INFO L226 Difference]: Without dead ends: 211 [2019-10-15 01:59:59,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-10-15 01:59:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-15 01:59:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 185. [2019-10-15 01:59:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-15 01:59:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 223 transitions. [2019-10-15 01:59:59,402 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 223 transitions. Word has length 31 [2019-10-15 01:59:59,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:59:59,403 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 223 transitions. [2019-10-15 01:59:59,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:59:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 223 transitions. [2019-10-15 01:59:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:59:59,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:59:59,404 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:59:59,405 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:59:59,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:59:59,405 INFO L82 PathProgramCache]: Analyzing trace with hash 340483944, now seen corresponding path program 1 times [2019-10-15 01:59:59,405 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:59:59,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7445068] [2019-10-15 01:59:59,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:59,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:59:59,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:59:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:59:59,966 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-10-15 02:00:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:00,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7445068] [2019-10-15 02:00:00,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:00,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-15 02:00:00,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278265144] [2019-10-15 02:00:00,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-15 02:00:00,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:00,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-15 02:00:00,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-15 02:00:00,219 INFO L87 Difference]: Start difference. First operand 185 states and 223 transitions. Second operand 17 states. [2019-10-15 02:00:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:03,529 INFO L93 Difference]: Finished difference Result 307 states and 377 transitions. [2019-10-15 02:00:03,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 02:00:03,530 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-10-15 02:00:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:03,533 INFO L225 Difference]: With dead ends: 307 [2019-10-15 02:00:03,533 INFO L226 Difference]: Without dead ends: 304 [2019-10-15 02:00:03,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2019-10-15 02:00:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-15 02:00:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 272. [2019-10-15 02:00:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-15 02:00:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 335 transitions. [2019-10-15 02:00:03,569 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 335 transitions. Word has length 34 [2019-10-15 02:00:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:03,569 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 335 transitions. [2019-10-15 02:00:03,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-15 02:00:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 335 transitions. [2019-10-15 02:00:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 02:00:03,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:03,571 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:03,572 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:03,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1593934570, now seen corresponding path program 1 times [2019-10-15 02:00:03,572 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:03,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499980518] [2019-10-15 02:00:03,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:03,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:03,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:04,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499980518] [2019-10-15 02:00:04,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:04,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-15 02:00:04,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928390783] [2019-10-15 02:00:04,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 02:00:04,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:04,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 02:00:04,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-15 02:00:04,014 INFO L87 Difference]: Start difference. First operand 272 states and 335 transitions. Second operand 15 states. [2019-10-15 02:00:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:06,670 INFO L93 Difference]: Finished difference Result 306 states and 375 transitions. [2019-10-15 02:00:06,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-15 02:00:06,672 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-10-15 02:00:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:06,675 INFO L225 Difference]: With dead ends: 306 [2019-10-15 02:00:06,676 INFO L226 Difference]: Without dead ends: 303 [2019-10-15 02:00:06,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-10-15 02:00:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-10-15 02:00:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 272. [2019-10-15 02:00:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-15 02:00:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 334 transitions. [2019-10-15 02:00:06,719 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 334 transitions. Word has length 37 [2019-10-15 02:00:06,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:06,722 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 334 transitions. [2019-10-15 02:00:06,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 02:00:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 334 transitions. [2019-10-15 02:00:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 02:00:06,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:06,726 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:06,726 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:06,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:06,726 INFO L82 PathProgramCache]: Analyzing trace with hash 30681139, now seen corresponding path program 1 times [2019-10-15 02:00:06,727 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:06,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061016046] [2019-10-15 02:00:06,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:06,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:06,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:07,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061016046] [2019-10-15 02:00:07,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:07,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-15 02:00:07,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303374419] [2019-10-15 02:00:07,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-15 02:00:07,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:07,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-15 02:00:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-15 02:00:07,291 INFO L87 Difference]: Start difference. First operand 272 states and 334 transitions. Second operand 16 states. [2019-10-15 02:00:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:09,836 INFO L93 Difference]: Finished difference Result 301 states and 367 transitions. [2019-10-15 02:00:09,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 02:00:09,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-10-15 02:00:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:09,844 INFO L225 Difference]: With dead ends: 301 [2019-10-15 02:00:09,845 INFO L226 Difference]: Without dead ends: 298 [2019-10-15 02:00:09,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2019-10-15 02:00:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-15 02:00:09,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 272. [2019-10-15 02:00:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-15 02:00:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 333 transitions. [2019-10-15 02:00:09,880 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 333 transitions. Word has length 40 [2019-10-15 02:00:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:09,880 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 333 transitions. [2019-10-15 02:00:09,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-15 02:00:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 333 transitions. [2019-10-15 02:00:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 02:00:09,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:09,891 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:09,891 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:09,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1014815005, now seen corresponding path program 1 times [2019-10-15 02:00:09,892 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:09,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172237919] [2019-10-15 02:00:09,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:09,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:09,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:10,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172237919] [2019-10-15 02:00:10,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:10,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-15 02:00:10,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791590166] [2019-10-15 02:00:10,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-15 02:00:10,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:10,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-15 02:00:10,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-15 02:00:10,655 INFO L87 Difference]: Start difference. First operand 272 states and 333 transitions. Second operand 16 states. [2019-10-15 02:00:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:13,863 INFO L93 Difference]: Finished difference Result 304 states and 371 transitions. [2019-10-15 02:00:13,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 02:00:13,864 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-10-15 02:00:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:13,866 INFO L225 Difference]: With dead ends: 304 [2019-10-15 02:00:13,867 INFO L226 Difference]: Without dead ends: 301 [2019-10-15 02:00:13,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-10-15 02:00:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-15 02:00:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 272. [2019-10-15 02:00:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-15 02:00:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 332 transitions. [2019-10-15 02:00:13,898 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 332 transitions. Word has length 43 [2019-10-15 02:00:13,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:13,899 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 332 transitions. [2019-10-15 02:00:13,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-15 02:00:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 332 transitions. [2019-10-15 02:00:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 02:00:13,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:13,902 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:13,902 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1716719016, now seen corresponding path program 1 times [2019-10-15 02:00:13,902 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:13,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226957735] [2019-10-15 02:00:13,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:13,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:13,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 02:00:15,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226957735] [2019-10-15 02:00:15,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060928704] [2019-10-15 02:00:15,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:00:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:15,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 132 conjunts are in the unsatisfiable core [2019-10-15 02:00:15,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:00:15,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-15 02:00:15,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:15,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:15,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-15 02:00:15,388 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:15,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:15,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 02:00:15,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-10-15 02:00:15,518 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 15 treesize of output 1 [2019-10-15 02:00:15,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:15,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:15,538 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_4| vanished before elimination [2019-10-15 02:00:15,541 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 15 treesize of output 1 [2019-10-15 02:00:15,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:15,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:15,553 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_BEFORE_CALL_4| vanished before elimination [2019-10-15 02:00:15,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 02:00:15,554 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:53, output treesize:18 [2019-10-15 02:00:15,796 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2019-10-15 02:00:15,797 INFO L341 Elim1Store]: treesize reduction 165, result has 27.3 percent of original size [2019-10-15 02:00:15,797 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 3 case distinctions, treesize of input 77 treesize of output 69 [2019-10-15 02:00:15,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:15,866 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.7 percent of original size [2019-10-15 02:00:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:15,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:15,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:84 [2019-10-15 02:00:15,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:15,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:15,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:15,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:16,179 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-15 02:00:16,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:16,217 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:16,374 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2019-10-15 02:00:16,374 INFO L567 ElimStorePlain]: treesize reduction 95, result has 67.6 percent of original size [2019-10-15 02:00:16,380 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:16,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:16,481 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:16,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:16,553 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:16,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:16,618 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-10-15 02:00:16,618 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-10-15 02:00:16,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-10-15 02:00:16,621 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:300, output treesize:201 [2019-10-15 02:00:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:16,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:16,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:17,065 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-15 02:00:17,066 INFO L341 Elim1Store]: treesize reduction 78, result has 82.1 percent of original size [2019-10-15 02:00:17,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 437 [2019-10-15 02:00:17,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:17,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:17,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:17,570 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2019-10-15 02:00:17,571 INFO L341 Elim1Store]: treesize reduction 65, result has 89.0 percent of original size [2019-10-15 02:00:17,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 593 [2019-10-15 02:00:17,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:18,023 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 96 [2019-10-15 02:00:18,023 INFO L567 ElimStorePlain]: treesize reduction 801, result has 36.5 percent of original size [2019-10-15 02:00:18,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-10-15 02:00:18,048 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:237, output treesize:461 [2019-10-15 02:00:18,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:18,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:19,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:19,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:19,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:19,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:19,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:19,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:19,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:19,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:19,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:19,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:21,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:21,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:21,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:21,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:21,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:21,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:21,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:21,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:21,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:21,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:21,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:22,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:24,258 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_8, v_prenex_9], 2=[|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4|, |v_old(#memory_$Pointer$.base)_BEFORE_CALL_4|], 20=[v_prenex_7], 110=[|v_#memory_$Pointer$.base_BEFORE_CALL_7|]} [2019-10-15 02:00:24,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:24,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 124 [2019-10-15 02:00:24,277 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:24,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:24,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 123 [2019-10-15 02:00:24,293 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:24,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:24,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 123 [2019-10-15 02:00:24,323 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:25,031 WARN L191 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 116 [2019-10-15 02:00:25,032 INFO L567 ElimStorePlain]: treesize reduction 1988, result has 24.7 percent of original size [2019-10-15 02:00:25,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:25,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2019-10-15 02:00:25,052 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:25,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:25,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2019-10-15 02:00:25,071 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:25,329 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-10-15 02:00:25,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:25,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:25,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 101 [2019-10-15 02:00:25,344 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:25,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:25,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 91 [2019-10-15 02:00:25,358 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:25,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:25,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2019-10-15 02:00:25,372 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:25,376 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 02:00:25,377 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 02:00:25,378 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:25,758 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2019-10-15 02:00:25,759 INFO L567 ElimStorePlain]: treesize reduction 101, result has 80.3 percent of original size [2019-10-15 02:00:25,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:25,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2019-10-15 02:00:25,772 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:25,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:25,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2019-10-15 02:00:25,785 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:25,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:25,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2019-10-15 02:00:25,798 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:25,985 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-15 02:00:25,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:25,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:26,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:26,145 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-15 02:00:26,146 INFO L341 Elim1Store]: treesize reduction 10, result has 89.7 percent of original size [2019-10-15 02:00:26,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 124 [2019-10-15 02:00:26,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,167 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:26,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:26,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:26,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2019-10-15 02:00:26,188 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:26,416 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-10-15 02:00:26,417 INFO L567 ElimStorePlain]: treesize reduction 97, result has 71.2 percent of original size [2019-10-15 02:00:26,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:26,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:26,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:26,589 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-15 02:00:26,590 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:26,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 79 treesize of output 203 [2019-10-15 02:00:26,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,716 INFO L496 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:26,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:26,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:26,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:26,836 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:26,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 124 [2019-10-15 02:00:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:26,851 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:26,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:26,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:26,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 106 [2019-10-15 02:00:26,938 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:27,015 INFO L567 ElimStorePlain]: treesize reduction 273, result has 5.2 percent of original size [2019-10-15 02:00:27,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 02:00:27,016 INFO L221 ElimStorePlain]: Needed 18 recursive calls to eliminate 15 variables, input treesize:2718, output treesize:15 [2019-10-15 02:00:27,251 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 15 treesize of output 1 [2019-10-15 02:00:27,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:27,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:27,267 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_8| vanished before elimination [2019-10-15 02:00:27,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 02:00:27,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:15 [2019-10-15 02:00:27,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 02:00:27,731 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-10-15 02:00:27,732 INFO L341 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2019-10-15 02:00:27,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 108 [2019-10-15 02:00:27,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:28,037 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-15 02:00:28,038 INFO L567 ElimStorePlain]: treesize reduction 36, result has 81.6 percent of original size [2019-10-15 02:00:28,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:28,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:28,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:28,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:166, output treesize:160 [2019-10-15 02:00:28,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:28,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:28,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:00:28,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:31,562 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-10-15 02:00:31,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 02:00:31,593 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:31,618 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:31,669 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:31,678 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:31,686 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 02:00:31,695 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.