/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 02:08:56,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 02:08:56,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 02:08:56,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 02:08:56,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 02:08:56,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 02:08:56,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 02:08:56,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 02:08:56,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 02:08:56,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 02:08:56,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 02:08:56,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 02:08:56,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 02:08:56,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 02:08:56,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 02:08:56,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 02:08:56,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 02:08:56,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 02:08:56,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 02:08:56,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 02:08:56,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 02:08:56,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 02:08:56,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 02:08:56,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 02:08:56,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 02:08:56,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 02:08:56,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 02:08:56,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 02:08:56,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 02:08:56,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 02:08:56,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 02:08:56,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 02:08:56,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 02:08:56,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 02:08:56,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 02:08:56,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 02:08:56,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 02:08:56,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 02:08:56,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 02:08:56,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 02:08:56,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 02:08:56,852 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-11-07 02:08:56,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 02:08:56,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 02:08:56,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 02:08:56,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 02:08:56,873 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 02:08:56,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 02:08:56,874 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 02:08:56,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 02:08:56,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 02:08:56,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 02:08:56,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 02:08:56,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 02:08:56,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 02:08:56,875 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 02:08:56,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 02:08:56,875 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 02:08:56,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 02:08:56,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 02:08:56,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 02:08:56,876 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 02:08:56,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 02:08:56,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 02:08:56,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 02:08:56,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 02:08:56,877 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 02:08:56,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 02:08:56,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 02:08:56,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 02:08:56,878 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 02:08:57,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 02:08:57,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 02:08:57,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 02:08:57,204 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 02:08:57,205 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 02:08:57,206 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets-1.i [2019-11-07 02:08:57,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d000a8d74/4853328a65ee4ccba57c47c442c9eb59/FLAG45f44db0f [2019-11-07 02:08:57,813 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 02:08:57,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i [2019-11-07 02:08:57,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d000a8d74/4853328a65ee4ccba57c47c442c9eb59/FLAG45f44db0f [2019-11-07 02:08:58,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d000a8d74/4853328a65ee4ccba57c47c442c9eb59 [2019-11-07 02:08:58,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 02:08:58,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 02:08:58,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 02:08:58,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 02:08:58,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 02:08:58,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:08:58" (1/1) ... [2019-11-07 02:08:58,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18fabf38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:58, skipping insertion in model container [2019-11-07 02:08:58,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:08:58" (1/1) ... [2019-11-07 02:08:58,153 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 02:08:58,212 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 02:08:58,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 02:08:58,607 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 02:08:58,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 02:08:58,718 INFO L192 MainTranslator]: Completed translation [2019-11-07 02:08:58,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:58 WrapperNode [2019-11-07 02:08:58,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 02:08:58,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 02:08:58,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 02:08:58,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 02:08:58,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:58" (1/1) ... [2019-11-07 02:08:58,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:58" (1/1) ... [2019-11-07 02:08:58,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:58" (1/1) ... [2019-11-07 02:08:58,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:58" (1/1) ... [2019-11-07 02:08:58,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:58" (1/1) ... [2019-11-07 02:08:58,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:58" (1/1) ... [2019-11-07 02:08:58,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:58" (1/1) ... [2019-11-07 02:08:58,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 02:08:58,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 02:08:58,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 02:08:58,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 02:08:58,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:58" (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-11-07 02:08:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 02:08:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 02:08:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 02:08:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-07 02:08:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-07 02:08:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-07 02:08:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-07 02:08:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-07 02:08:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-07 02:08:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-07 02:08:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-07 02:08:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-07 02:08:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-07 02:08:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-07 02:08:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-07 02:08:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-07 02:08:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-07 02:08:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-07 02:08:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-07 02:08:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-07 02:08:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-07 02:08:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-07 02:08:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-07 02:08:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-07 02:08:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-07 02:08:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-07 02:08:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-07 02:08:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-07 02:08:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-07 02:08:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-07 02:08:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-07 02:08:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-07 02:08:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-07 02:08:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-07 02:08:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-07 02:08:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-07 02:08:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-07 02:08:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-07 02:08:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-07 02:08:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-07 02:08:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-07 02:08:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-07 02:08:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-07 02:08:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-07 02:08:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-07 02:08:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-07 02:08:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-07 02:08:58,874 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-07 02:08:58,874 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-07 02:08:58,874 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-07 02:08:58,874 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-07 02:08:58,874 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-07 02:08:58,874 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-07 02:08:58,874 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 02:08:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-07 02:08:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-07 02:08:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 02:08:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-07 02:08:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-07 02:08:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-07 02:08:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-07 02:08:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-07 02:08:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-07 02:08:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-07 02:08:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-07 02:08:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-07 02:08:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 02:08:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-07 02:08:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-07 02:08:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-07 02:08:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-07 02:08:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-07 02:08:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-07 02:08:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-07 02:08:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-07 02:08:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-07 02:08:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-07 02:08:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-07 02:08:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-07 02:08:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-07 02:08:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-07 02:08:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-07 02:08:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-07 02:08:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-07 02:08:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-07 02:08:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-07 02:08:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-07 02:08:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-07 02:08:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-07 02:08:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-07 02:08:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-07 02:08:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-07 02:08:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-07 02:08:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-07 02:08:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-07 02:08:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-07 02:08:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-07 02:08:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-07 02:08:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-07 02:08:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-07 02:08:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-07 02:08:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-07 02:08:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-07 02:08:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-07 02:08:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-07 02:08:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-07 02:08:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 02:08:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 02:08:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 02:08:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-07 02:08:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 02:08:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 02:08:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 02:08:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 02:08:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 02:08:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 02:08:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 02:08:59,757 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 02:08:59,757 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-07 02:08:59,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:08:59 BoogieIcfgContainer [2019-11-07 02:08:59,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 02:08:59,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 02:08:59,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 02:08:59,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 02:08:59,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:08:58" (1/3) ... [2019-11-07 02:08:59,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517a3b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:08:59, skipping insertion in model container [2019-11-07 02:08:59,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:58" (2/3) ... [2019-11-07 02:08:59,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517a3b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:08:59, skipping insertion in model container [2019-11-07 02:08:59,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:08:59" (3/3) ... [2019-11-07 02:08:59,768 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2019-11-07 02:08:59,779 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 02:08:59,787 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-07 02:08:59,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-07 02:08:59,824 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 02:08:59,825 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 02:08:59,825 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 02:08:59,825 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 02:08:59,826 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 02:08:59,826 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 02:08:59,826 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 02:08:59,826 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 02:08:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-11-07 02:08:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-07 02:08:59,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:08:59,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:08:59,858 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:08:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:08:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1367569032, now seen corresponding path program 1 times [2019-11-07 02:08:59,875 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:08:59,876 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852842988] [2019-11-07 02:08:59,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:00,288 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852842988] [2019-11-07 02:09:00,289 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:09:00,289 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 02:09:00,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146522686] [2019-11-07 02:09:00,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 02:09:00,296 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:09:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 02:09:00,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 02:09:00,309 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 4 states. [2019-11-07 02:09:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:09:00,460 INFO L93 Difference]: Finished difference Result 104 states and 168 transitions. [2019-11-07 02:09:00,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 02:09:00,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-07 02:09:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:09:00,477 INFO L225 Difference]: With dead ends: 104 [2019-11-07 02:09:00,477 INFO L226 Difference]: Without dead ends: 63 [2019-11-07 02:09:00,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 02:09:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-07 02:09:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2019-11-07 02:09:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-07 02:09:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-11-07 02:09:00,525 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 9 [2019-11-07 02:09:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:09:00,525 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-11-07 02:09:00,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 02:09:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-11-07 02:09:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 02:09:00,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:00,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:00,527 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash 26280220, now seen corresponding path program 1 times [2019-11-07 02:09:00,527 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:00,528 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40863960] [2019-11-07 02:09:00,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:00,579 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40863960] [2019-11-07 02:09:00,580 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:09:00,580 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 02:09:00,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134481507] [2019-11-07 02:09:00,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 02:09:00,583 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:09:00,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 02:09:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:09:00,584 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2019-11-07 02:09:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:09:00,671 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-11-07 02:09:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 02:09:00,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-07 02:09:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:09:00,673 INFO L225 Difference]: With dead ends: 45 [2019-11-07 02:09:00,673 INFO L226 Difference]: Without dead ends: 43 [2019-11-07 02:09:00,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:09:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-07 02:09:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-11-07 02:09:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 02:09:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-07 02:09:00,681 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 11 [2019-11-07 02:09:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:09:00,682 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-07 02:09:00,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 02:09:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-11-07 02:09:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 02:09:00,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:00,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:00,683 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:00,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:00,684 INFO L82 PathProgramCache]: Analyzing trace with hash -82509002, now seen corresponding path program 1 times [2019-11-07 02:09:00,684 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:00,684 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719422545] [2019-11-07 02:09:00,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:00,768 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719422545] [2019-11-07 02:09:00,768 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:09:00,768 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 02:09:00,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019757068] [2019-11-07 02:09:00,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 02:09:00,769 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:09:00,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 02:09:00,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:09:00,770 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 3 states. [2019-11-07 02:09:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:09:00,799 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-11-07 02:09:00,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 02:09:00,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-07 02:09:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:09:00,800 INFO L225 Difference]: With dead ends: 43 [2019-11-07 02:09:00,800 INFO L226 Difference]: Without dead ends: 41 [2019-11-07 02:09:00,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:09:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-07 02:09:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2019-11-07 02:09:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-07 02:09:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-11-07 02:09:00,807 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 12 [2019-11-07 02:09:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:09:00,808 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-11-07 02:09:00,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 02:09:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-11-07 02:09:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 02:09:00,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:00,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:00,809 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:00,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1735436749, now seen corresponding path program 1 times [2019-11-07 02:09:00,810 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:00,810 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618102601] [2019-11-07 02:09:00,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:00,972 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618102601] [2019-11-07 02:09:00,972 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:09:00,972 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 02:09:00,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446911870] [2019-11-07 02:09:00,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 02:09:00,973 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:09:00,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 02:09:00,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 02:09:00,975 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 5 states. [2019-11-07 02:09:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:09:01,137 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-07 02:09:01,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 02:09:01,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-07 02:09:01,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:09:01,139 INFO L225 Difference]: With dead ends: 57 [2019-11-07 02:09:01,139 INFO L226 Difference]: Without dead ends: 46 [2019-11-07 02:09:01,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 02:09:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-07 02:09:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-11-07 02:09:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-07 02:09:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-11-07 02:09:01,150 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 13 [2019-11-07 02:09:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:09:01,150 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-11-07 02:09:01,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 02:09:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-11-07 02:09:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 02:09:01,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:01,155 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:01,155 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:01,156 INFO L82 PathProgramCache]: Analyzing trace with hash 23609448, now seen corresponding path program 1 times [2019-11-07 02:09:01,156 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:01,156 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945998242] [2019-11-07 02:09:01,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:01,308 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945998242] [2019-11-07 02:09:01,308 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776809786] [2019-11-07 02:09:01,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 02:09:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:01,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-07 02:09:01,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 02:09:01,715 INFO L341 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2019-11-07 02:09:01,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 42 [2019-11-07 02:09:01,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:01,934 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-07 02:09:01,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:01,939 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_51|], 4=[|v_#memory_$Pointer$.base_52|], 6=[|v_#memory_$Pointer$.base_53|]} [2019-11-07 02:09:01,968 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-11-07 02:09:01,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2019-11-07 02:09:01,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:02,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:02,069 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:09:02,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:02,197 INFO L341 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2019-11-07 02:09:02,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 64 [2019-11-07 02:09:02,198 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:02,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:02,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-07 02:09:02,243 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:142, output treesize:126 [2019-11-07 02:09:02,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:02,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:02,395 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:02,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-07 02:09:02,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:02,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:02,449 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|, |v_#memory_$Pointer$.offset_51|], 54=[|v_#memory_$Pointer$.base_54|]} [2019-11-07 02:09:02,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:02,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:02,494 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_51| vanished before elimination [2019-11-07 02:09:03,096 WARN L191 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 120 [2019-11-07 02:09:03,097 INFO L341 Elim1Store]: treesize reduction 272, result has 51.1 percent of original size [2019-11-07 02:09:03,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 141 treesize of output 342 [2019-11-07 02:09:03,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:03,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,213 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:09:03,335 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 45 [2019-11-07 02:09:03,335 INFO L567 ElimStorePlain]: treesize reduction 294, result has 25.6 percent of original size [2019-11-07 02:09:03,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-07 02:09:03,337 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:175, output treesize:130 [2019-11-07 02:09:03,790 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2019-11-07 02:09:03,790 INFO L341 Elim1Store]: treesize reduction 30, result has 88.0 percent of original size [2019-11-07 02:09:03,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 133 treesize of output 269 [2019-11-07 02:09:03,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,814 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:09:03,862 INFO L567 ElimStorePlain]: treesize reduction 104, result has 21.8 percent of original size [2019-11-07 02:09:03,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 02:09:03,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:4 [2019-11-07 02:09:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:03,869 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 02:09:03,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:03,882 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|, |v_#memory_$Pointer$.offset_52|], 2=[|v_#memory_$Pointer$.base_55|]} [2019-11-07 02:09:03,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 02:09:03,890 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:03,890 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 1 case distinctions, treesize of input 23 treesize of output 8 [2019-11-07 02:09:03,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:03,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:03,906 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-11-07 02:09:03,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:03,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:03,918 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:09:03,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:03,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-07 02:09:03,928 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:61, output treesize:28 [2019-11-07 02:09:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:03,960 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [596971019] [2019-11-07 02:09:03,985 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-07 02:09:03,986 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 02:09:03,991 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 02:09:03,998 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 02:09:03,998 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 02:09:04,070 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 02:09:24,646 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 02:09:24,654 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 02:09:44,173 WARN L191 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 312