java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:02:49,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:02:49,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:02:49,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:02:49,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:02:49,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:02:49,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:02:49,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:02:49,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:02:49,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:02:49,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:02:49,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:02:49,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:02:49,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:02:49,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:02:49,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:02:49,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:02:49,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:02:49,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:02:49,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:02:49,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:02:49,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:02:49,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:02:49,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:02:49,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:02:49,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:02:49,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:02:49,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:02:49,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:02:49,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:02:49,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:02:49,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:02:49,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:02:49,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:02:49,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:02:49,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:02:49,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:02:49,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:02:49,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:02:49,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:02:49,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:02:49,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:02:49,888 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:02:49,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:02:49,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:02:49,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:02:49,890 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:02:49,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:02:49,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:02:49,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:02:49,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:02:49,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:02:49,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:02:49,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:02:49,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:02:49,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:02:49,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:02:49,893 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:02:49,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:02:49,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:02:49,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:02:49,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:02:49,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:02:49,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:02:49,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:02:49,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:02:49,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:02:49,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:02:49,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:02:49,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:02:49,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:02:49,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:02:49,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:02:49,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:02:49,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:02:49,942 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:02:49,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i [2019-09-20 13:02:50,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f348589/329a0d66fc194e38aaf042f7c6cc82ac/FLAG50f65a740 [2019-09-20 13:02:50,552 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:02:50,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i [2019-09-20 13:02:50,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f348589/329a0d66fc194e38aaf042f7c6cc82ac/FLAG50f65a740 [2019-09-20 13:02:50,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f348589/329a0d66fc194e38aaf042f7c6cc82ac [2019-09-20 13:02:50,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:02:50,837 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:02:50,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:50,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:02:50,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:02:50,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:50" (1/1) ... [2019-09-20 13:02:50,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245cb49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:50, skipping insertion in model container [2019-09-20 13:02:50,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:50" (1/1) ... [2019-09-20 13:02:50,856 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:02:50,910 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:02:51,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:51,476 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:02:51,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:51,582 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:02:51,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:51 WrapperNode [2019-09-20 13:02:51,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:51,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:02:51,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:02:51,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:02:51,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:51" (1/1) ... [2019-09-20 13:02:51,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:51" (1/1) ... [2019-09-20 13:02:51,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:51" (1/1) ... [2019-09-20 13:02:51,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:51" (1/1) ... [2019-09-20 13:02:51,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:51" (1/1) ... [2019-09-20 13:02:51,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:51" (1/1) ... [2019-09-20 13:02:51,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:51" (1/1) ... [2019-09-20 13:02:51,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:02:51,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:02:51,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:02:51,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:02:51,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:02:51,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:02:51,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:02:51,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-20 13:02:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-20 13:02:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-20 13:02:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-09-20 13:02:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-09-20 13:02:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-09-20 13:02:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2019-09-20 13:02:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:02:51,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:02:51,715 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-20 13:02:51,715 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-20 13:02:51,715 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:02:51,715 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:02:51,716 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:02:51,716 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:02:51,716 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:02:51,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:02:51,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:02:51,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:02:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:02:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:02:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:02:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:02:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:02:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:02:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:02:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:02:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:02:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:02:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:02:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:02:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:02:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:02:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:02:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:02:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:02:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:02:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:02:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:02:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:02:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:02:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:02:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:02:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:02:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:02:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:02:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:02:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:02:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:02:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:02:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:02:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:02:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:02:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:02:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:02:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:02:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:02:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:02:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:02:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:02:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:02:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:02:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:02:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:02:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:02:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:02:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:02:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:02:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:02:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:02:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:02:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:02:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:02:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:02:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:02:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:02:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:02:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:02:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:02:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:02:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:02:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:02:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:02:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:02:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:02:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:02:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:02:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:02:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:02:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:02:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:02:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:02:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:02:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:02:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:02:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:02:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:02:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:02:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:02:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:02:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:02:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:02:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:02:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:02:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:02:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:02:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:02:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:02:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:02:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:02:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:02:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:02:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:02:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:02:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-20 13:02:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-09-20 13:02:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:02:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:02:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:02:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-09-20 13:02:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-09-20 13:02:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:02:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:02:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2019-09-20 13:02:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:02:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:02:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:02:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:02:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:02:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:02:52,069 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-20 13:02:52,276 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:02:52,277 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-20 13:02:52,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:52 BoogieIcfgContainer [2019-09-20 13:02:52,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:02:52,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:02:52,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:02:52,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:02:52,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:02:50" (1/3) ... [2019-09-20 13:02:52,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaee6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:52, skipping insertion in model container [2019-09-20 13:02:52,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:51" (2/3) ... [2019-09-20 13:02:52,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaee6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:52, skipping insertion in model container [2019-09-20 13:02:52,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:52" (3/3) ... [2019-09-20 13:02:52,301 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2019-09-20 13:02:52,313 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:02:52,323 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:02:52,342 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:02:52,379 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:02:52,380 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:02:52,380 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:02:52,381 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:02:52,381 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:02:52,381 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:02:52,381 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:02:52,381 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:02:52,381 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:02:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-09-20 13:02:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:02:52,414 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:52,414 INFO L407 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-09-20 13:02:52,416 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1741018156, now seen corresponding path program 1 times [2019-09-20 13:02:52,424 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:52,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:52,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:52,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:52,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:52,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:02:52,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:02:52,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:02:52,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:02:52,651 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2019-09-20 13:02:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:52,682 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2019-09-20 13:02:52,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:02:52,683 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2019-09-20 13:02:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:52,693 INFO L225 Difference]: With dead ends: 80 [2019-09-20 13:02:52,693 INFO L226 Difference]: Without dead ends: 33 [2019-09-20 13:02:52,697 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:02:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-20 13:02:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-20 13:02:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-20 13:02:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-09-20 13:02:52,742 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2019-09-20 13:02:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:52,743 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-09-20 13:02:52,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:02:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-09-20 13:02:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:02:52,746 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:52,746 INFO L407 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-09-20 13:02:52,746 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:52,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:52,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1529575644, now seen corresponding path program 1 times [2019-09-20 13:02:52,747 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:52,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:52,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:52,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:52,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:52,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:52,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:02:52,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:02:52,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:02:52,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:52,894 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 5 states. [2019-09-20 13:02:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:52,954 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-09-20 13:02:52,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:02:52,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-20 13:02:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:52,956 INFO L225 Difference]: With dead ends: 58 [2019-09-20 13:02:52,956 INFO L226 Difference]: Without dead ends: 37 [2019-09-20 13:02:52,957 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:02:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-20 13:02:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-09-20 13:02:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-20 13:02:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-09-20 13:02:52,989 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 28 [2019-09-20 13:02:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:52,989 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-09-20 13:02:52,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:02:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-09-20 13:02:52,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-20 13:02:52,991 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:52,991 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:52,991 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:52,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:52,992 INFO L82 PathProgramCache]: Analyzing trace with hash -937541417, now seen corresponding path program 1 times [2019-09-20 13:02:52,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:52,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:52,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:52,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:52,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:02:53,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:53,146 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:53,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:53,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 13:02:53,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:53,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:53,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-20 13:02:53,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:02:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:02:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:02:53,391 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 6 states. [2019-09-20 13:02:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:53,445 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2019-09-20 13:02:53,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:02:53,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-09-20 13:02:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:53,447 INFO L225 Difference]: With dead ends: 62 [2019-09-20 13:02:53,448 INFO L226 Difference]: Without dead ends: 41 [2019-09-20 13:02:53,448 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:02:53,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-20 13:02:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-09-20 13:02:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-20 13:02:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-20 13:02:53,456 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 37 [2019-09-20 13:02:53,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:53,456 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-20 13:02:53,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:02:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-20 13:02:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:02:53,460 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:53,460 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:53,461 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:53,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1717388092, now seen corresponding path program 2 times [2019-09-20 13:02:53,461 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:53,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:53,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-20 13:02:53,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:53,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:02:53,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:02:53,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:02:53,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:02:53,833 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 11 states. [2019-09-20 13:02:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:54,156 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-09-20 13:02:54,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:02:54,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-09-20 13:02:54,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:54,158 INFO L225 Difference]: With dead ends: 45 [2019-09-20 13:02:54,159 INFO L226 Difference]: Without dead ends: 43 [2019-09-20 13:02:54,159 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:02:54,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-20 13:02:54,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-09-20 13:02:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-20 13:02:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-09-20 13:02:54,168 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 46 [2019-09-20 13:02:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:54,168 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-09-20 13:02:54,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:02:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-09-20 13:02:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:02:54,170 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:54,170 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:54,171 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1717386418, now seen corresponding path program 1 times [2019-09-20 13:02:54,171 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:54,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:54,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:54,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:54,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-20 13:02:54,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:54,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:02:54,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:02:54,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:02:54,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:02:54,315 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 9 states. [2019-09-20 13:02:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:54,441 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-20 13:02:54,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:02:54,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-09-20 13:02:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:54,443 INFO L225 Difference]: With dead ends: 43 [2019-09-20 13:02:54,443 INFO L226 Difference]: Without dead ends: 40 [2019-09-20 13:02:54,444 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:02:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-20 13:02:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-20 13:02:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-20 13:02:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-20 13:02:54,457 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 46 [2019-09-20 13:02:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:54,459 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-20 13:02:54,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:02:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-20 13:02:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:02:54,461 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:54,461 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:54,461 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1142561111, now seen corresponding path program 1 times [2019-09-20 13:02:54,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:54,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:54,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:54,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:54,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:55,327 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-20 13:02:55,867 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-09-20 13:02:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 13:02:56,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:56,097 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:56,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:56,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-20 13:02:56,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:56,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:56,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:56,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:56,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:56,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:02:56,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:56,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:56,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:56,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:56,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-09-20 13:02:56,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-09-20 13:02:56,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:56,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:56,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:56,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-09-20 13:02:56,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-09-20 13:02:56,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:56,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:56,607 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 15 treesize of output 7 [2019-09-20 13:02:56,608 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:56,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:56,634 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 21 treesize of output 13 [2019-09-20 13:02:56,635 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:56,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:56,657 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-09-20 13:02:56,658 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:56,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:56,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:56,670 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:13 [2019-09-20 13:02:56,766 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:56,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:56,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:56,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:70 [2019-09-20 13:02:58,213 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-20 13:02:59,459 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 48 [2019-09-20 13:02:59,480 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|], 8=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|]} [2019-09-20 13:02:59,488 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:59,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:59,550 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:59,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:59,608 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:59,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:59,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:59,645 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:153, output treesize:192 [2019-09-20 13:03:05,954 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-09-20 13:03:05,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:05,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-09-20 13:03:05,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:06,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:06,098 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_BEFORE_CALL_4|], 16=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|]} [2019-09-20 13:03:06,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:06,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:06,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 29 [2019-09-20 13:03:06,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:06,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:06,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:06,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:06,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 38 [2019-09-20 13:03:06,217 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:06,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:06,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:06,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:06,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 28 [2019-09-20 13:03:06,288 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:06,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:06,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:06,324 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:241, output treesize:89 [2019-09-20 13:03:06,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:06,546 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:03:06,551 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:06,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 58 [2019-09-20 13:03:06,554 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:06,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:06,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:06,583 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:06,584 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2019-09-20 13:03:06,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:06,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:06,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:06,600 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:17 [2019-09-20 13:03:06,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:06,756 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:03:06,757 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:03:06,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-09-20 13:03:06,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:06,762 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 13:03:06,763 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:06,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:06,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:06,772 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-09-20 13:03:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:03:06,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:06,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2019-09-20 13:03:06,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-20 13:03:06,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-20 13:03:06,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1035, Unknown=3, NotChecked=0, Total=1122 [2019-09-20 13:03:06,845 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 34 states. [2019-09-20 13:03:08,507 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 56 [2019-09-20 13:03:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:09,789 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-09-20 13:03:09,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-20 13:03:09,795 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-09-20 13:03:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:09,797 INFO L225 Difference]: With dead ends: 47 [2019-09-20 13:03:09,797 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:03:09,800 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=161, Invalid=1816, Unknown=3, NotChecked=0, Total=1980 [2019-09-20 13:03:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:03:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-09-20 13:03:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 13:03:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-09-20 13:03:09,810 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 48 [2019-09-20 13:03:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:09,811 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-09-20 13:03:09,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-20 13:03:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-09-20 13:03:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:03:09,812 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:09,812 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:09,812 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:09,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1142559437, now seen corresponding path program 1 times [2019-09-20 13:03:09,813 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:09,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:09,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:09,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:09,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 13:03:10,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:10,212 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:10,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:10,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-20 13:03:10,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:10,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-09-20 13:03:10,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:10,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:10,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:03:14,497 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_26|], 8=[|v_#memory_$Pointer$.base_27|]} [2019-09-20 13:03:14,523 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:14,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-09-20 13:03:14,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:14,559 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-09-20 13:03:14,562 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:14,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:14,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:14,578 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:117 [2019-09-20 13:03:16,675 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 34 [2019-09-20 13:03:16,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:16,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:16,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:16,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:16,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 49 [2019-09-20 13:03:16,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:16,747 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2019-09-20 13:03:16,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:16,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:16,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:128, output treesize:50 [2019-09-20 13:03:16,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:16,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:16,812 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 43 treesize of output 35 [2019-09-20 13:03:16,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:16,817 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 53 treesize of output 45 [2019-09-20 13:03:16,817 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:16,844 INFO L567 ElimStorePlain]: treesize reduction 43, result has 42.7 percent of original size [2019-09-20 13:03:16,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:16,846 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:32 [2019-09-20 13:03:16,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:16,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2019-09-20 13:03:16,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:16,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:16,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:16,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:4 [2019-09-20 13:03:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 13:03:16,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:16,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2019-09-20 13:03:16,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-20 13:03:16,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-20 13:03:16,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=738, Unknown=2, NotChecked=0, Total=812 [2019-09-20 13:03:16,901 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 29 states. [2019-09-20 13:03:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:17,735 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-09-20 13:03:17,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-20 13:03:17,736 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 48 [2019-09-20 13:03:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:17,737 INFO L225 Difference]: With dead ends: 45 [2019-09-20 13:03:17,737 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 13:03:17,739 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=143, Invalid=1337, Unknown=2, NotChecked=0, Total=1482 [2019-09-20 13:03:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 13:03:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-20 13:03:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 13:03:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-20 13:03:17,749 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 48 [2019-09-20 13:03:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:17,749 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-20 13:03:17,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-20 13:03:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-20 13:03:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:03:17,751 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:17,752 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:17,752 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:17,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:17,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1510353742, now seen corresponding path program 2 times [2019-09-20 13:03:17,752 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:17,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:17,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:17,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:17,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:19,433 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-20 13:03:19,785 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-20 13:03:21,222 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 117 DAG size of output: 98 [2019-09-20 13:03:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:21,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:21,824 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:21,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:03:21,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:03:21,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:03:21,968 WARN L254 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-20 13:03:21,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:22,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:03:22,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:03:22,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:03:22,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-09-20 13:03:22,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-09-20 13:03:22,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-09-20 13:03:22,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-09-20 13:03:22,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-09-20 13:03:22,253 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_27|], 2=[|v_#memory_int_29|]} [2019-09-20 13:03:22,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-09-20 13:03:22,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-09-20 13:03:22,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,325 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:22,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:22,345 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:88, output treesize:52 [2019-09-20 13:03:23,213 WARN L191 SmtUtils]: Spent 722.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-09-20 13:03:23,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:23,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:03:23,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:23,325 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-09-20 13:03:23,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-09-20 13:03:23,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:23,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:23,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:23,368 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:50 [2019-09-20 13:03:23,502 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 1=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_29|]} [2019-09-20 13:03:23,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-09-20 13:03:23,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:23,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:23,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-09-20 13:03:23,548 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:23,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:23,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-09-20 13:03:23,581 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:23,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:23,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:23,604 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:84, output treesize:56 [2019-09-20 13:03:24,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-09-20 13:03:24,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:24,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:24,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:24,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-20 13:03:24,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:24,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:24,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:24,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 16 [2019-09-20 13:03:24,115 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:24,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:24,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:24,127 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:13 [2019-09-20 13:03:24,173 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:24,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:24,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:24,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:70 [2019-09-20 13:03:25,460 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-20 13:03:26,620 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 47 [2019-09-20 13:03:26,627 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_31|], 8=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_30|]} [2019-09-20 13:03:26,631 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:26,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:26,698 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:26,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:26,758 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:26,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:26,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:26,808 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:153, output treesize:192 [2019-09-20 13:03:35,716 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-20 13:03:35,765 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:35,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2019-09-20 13:03:35,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:35,951 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-09-20 13:03:35,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:35,954 INFO L392 ElimStorePlain]: Different costs {3=[|v_old(#memory_int)_AFTER_CALL_19|], 23=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_19|, |v_#memory_$Pointer$.offset_BEFORE_CALL_8|]} [2019-09-20 13:03:35,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:35,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:35,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2019-09-20 13:03:35,973 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:36,082 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-09-20 13:03:36,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:36,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:36,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:36,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:36,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 84 [2019-09-20 13:03:36,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:36,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:36,111 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:36,319 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-20 13:03:36,320 INFO L567 ElimStorePlain]: treesize reduction 40, result has 80.8 percent of original size [2019-09-20 13:03:36,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:36,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:36,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:36,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:36,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 39 [2019-09-20 13:03:36,335 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:36,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:36,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:36,387 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:288, output treesize:139