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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:03:50,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:03:50,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:03:50,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:03:50,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:03:50,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:03:50,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:03:50,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:03:50,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:03:50,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:03:50,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:03:50,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:03:50,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:03:50,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:03:50,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:03:50,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:03:50,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:03:50,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:03:50,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:03:50,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:03:50,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:03:50,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:03:50,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:03:50,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:03:50,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:03:50,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:03:50,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:03:50,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:03:50,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:03:50,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:03:50,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:03:50,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:03:50,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:03:50,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:03:50,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:03:50,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:03:50,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:03:50,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:03:50,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:03:50,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:03:50,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:03:50,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:03:50,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:03:50,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:03:50,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:03:50,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:03:50,789 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:03:50,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:03:50,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:03:50,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:03:50,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:03:50,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:03:50,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:03:50,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:03:50,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:03:50,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:03:50,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:03:50,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:03:50,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:03:50,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:03:50,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:03:50,793 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:03:50,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:03:50,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:03:50,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:03:50,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:03:50,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:03:50,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:03:50,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:03:50,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:03:50,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:03:51,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:03:51,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:03:51,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:03:51,088 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:03:51,089 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:03:51,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2019-10-15 01:03:51,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b70c087a/60d6c049587545a7a788f38abcfb896c/FLAG29efc6403 [2019-10-15 01:03:51,767 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:03:51,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2019-10-15 01:03:51,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b70c087a/60d6c049587545a7a788f38abcfb896c/FLAG29efc6403 [2019-10-15 01:03:52,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b70c087a/60d6c049587545a7a788f38abcfb896c [2019-10-15 01:03:52,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:03:52,073 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:03:52,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:03:52,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:03:52,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:03:52,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:03:52" (1/1) ... [2019-10-15 01:03:52,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462d39e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:03:52, skipping insertion in model container [2019-10-15 01:03:52,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:03:52" (1/1) ... [2019-10-15 01:03:52,090 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:03:52,141 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:03:52,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:03:52,550 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:03:52,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:03:52,655 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:03:52,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:03:52 WrapperNode [2019-10-15 01:03:52,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:03:52,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:03:52,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:03:52,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:03:52,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:03:52" (1/1) ... [2019-10-15 01:03:52,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:03:52" (1/1) ... [2019-10-15 01:03:52,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:03:52" (1/1) ... [2019-10-15 01:03:52,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:03:52" (1/1) ... [2019-10-15 01:03:52,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:03:52" (1/1) ... [2019-10-15 01:03:52,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:03:52" (1/1) ... [2019-10-15 01:03:52,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:03:52" (1/1) ... [2019-10-15 01:03:52,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:03:52,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:03:52,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:03:52,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:03:52,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:03:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:03:52,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:03:52,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:03:52,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-15 01:03:52,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-15 01:03:52,781 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-15 01:03:52,782 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-15 01:03:52,782 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-10-15 01:03:52,782 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-10-15 01:03:52,783 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_insert [2019-10-15 01:03:52,783 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:03:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:03:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-15 01:03:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-15 01:03:52,784 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 01:03:52,784 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 01:03:52,784 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 01:03:52,784 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 01:03:52,784 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 01:03:52,784 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 01:03:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 01:03:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 01:03:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 01:03:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 01:03:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 01:03:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 01:03:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 01:03:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 01:03:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 01:03:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 01:03:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 01:03:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 01:03:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 01:03:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 01:03:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 01:03:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 01:03:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 01:03:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 01:03:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 01:03:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 01:03:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 01:03:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 01:03:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 01:03:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 01:03:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 01:03:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 01:03:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 01:03:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 01:03:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 01:03:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 01:03:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 01:03:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 01:03:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 01:03:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 01:03:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 01:03:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 01:03:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 01:03:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 01:03:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 01:03:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 01:03:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 01:03:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 01:03:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 01:03:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 01:03:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:03:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 01:03:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 01:03:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:03:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 01:03:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 01:03:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 01:03:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 01:03:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 01:03:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 01:03:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 01:03:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 01:03:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 01:03:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:03:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 01:03:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 01:03:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 01:03:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 01:03:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 01:03:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 01:03:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 01:03:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 01:03:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 01:03:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 01:03:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 01:03:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 01:03:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 01:03:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 01:03:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 01:03:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 01:03:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 01:03:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 01:03:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 01:03:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 01:03:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 01:03:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 01:03:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 01:03:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 01:03:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 01:03:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 01:03:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 01:03:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 01:03:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 01:03:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 01:03:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 01:03:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 01:03:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 01:03:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 01:03:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 01:03:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 01:03:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 01:03:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 01:03:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 01:03:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-15 01:03:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-15 01:03:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:03:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:03:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:03:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-10-15 01:03:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-10-15 01:03:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:03:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:03:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_insert [2019-10-15 01:03:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:03:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:03:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 01:03:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:03:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:03:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:03:53,149 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-15 01:03:53,422 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:03:53,423 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-15 01:03:53,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:53 BoogieIcfgContainer [2019-10-15 01:03:53,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:03:53,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:03:53,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:03:53,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:03:53,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:03:52" (1/3) ... [2019-10-15 01:03:53,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a45073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:03:53, skipping insertion in model container [2019-10-15 01:03:53,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:03:52" (2/3) ... [2019-10-15 01:03:53,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a45073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:03:53, skipping insertion in model container [2019-10-15 01:03:53,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:53" (3/3) ... [2019-10-15 01:03:53,446 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2019-10-15 01:03:53,454 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:03:53,462 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:03:53,473 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:03:53,501 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:03:53,502 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:03:53,502 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:03:53,502 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:03:53,503 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:03:53,503 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:03:53,503 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:03:53,503 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:03:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2019-10-15 01:03:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 01:03:53,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:03:53,532 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:03:53,534 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:03:53,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:03:53,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1328667979, now seen corresponding path program 1 times [2019-10-15 01:03:53,549 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:03:53,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226391407] [2019-10-15 01:03:53,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:03:53,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:03:53,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:03:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:03:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:03:53,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226391407] [2019-10-15 01:03:53,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:03:53,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:03:53,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081763024] [2019-10-15 01:03:53,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:03:53,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:03:53,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:03:53,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:03:53,842 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2019-10-15 01:03:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:03:53,886 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2019-10-15 01:03:53,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:03:53,887 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2019-10-15 01:03:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:03:53,896 INFO L225 Difference]: With dead ends: 97 [2019-10-15 01:03:53,896 INFO L226 Difference]: Without dead ends: 40 [2019-10-15 01:03:53,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:03:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-15 01:03:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-15 01:03:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-15 01:03:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2019-10-15 01:03:53,941 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 37 [2019-10-15 01:03:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:03:53,943 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-10-15 01:03:53,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:03:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2019-10-15 01:03:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 01:03:53,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:03:53,946 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:03:53,947 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:03:53,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:03:53,947 INFO L82 PathProgramCache]: Analyzing trace with hash 290011354, now seen corresponding path program 1 times [2019-10-15 01:03:53,947 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:03:53,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372505541] [2019-10-15 01:03:53,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:03:53,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:03:53,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:03:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:03:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:03:54,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372505541] [2019-10-15 01:03:54,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:03:54,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:03:54,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381094140] [2019-10-15 01:03:54,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:03:54,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:03:54,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:03:54,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:03:54,045 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 3 states. [2019-10-15 01:03:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:03:54,070 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-10-15 01:03:54,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:03:54,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-15 01:03:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:03:54,075 INFO L225 Difference]: With dead ends: 54 [2019-10-15 01:03:54,075 INFO L226 Difference]: Without dead ends: 44 [2019-10-15 01:03:54,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:03:54,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-15 01:03:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-10-15 01:03:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-15 01:03:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-10-15 01:03:54,085 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 37 [2019-10-15 01:03:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:03:54,086 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-10-15 01:03:54,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:03:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-10-15 01:03:54,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 01:03:54,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:03:54,088 INFO L380 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, 1] [2019-10-15 01:03:54,088 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:03:54,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:03:54,088 INFO L82 PathProgramCache]: Analyzing trace with hash 329318240, now seen corresponding path program 1 times [2019-10-15 01:03:54,089 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:03:54,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159367254] [2019-10-15 01:03:54,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:03:54,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:03:54,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:03:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:03:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:03:54,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159367254] [2019-10-15 01:03:54,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:03:54,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:03:54,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104078635] [2019-10-15 01:03:54,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:03:54,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:03:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:03:54,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:03:54,221 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 5 states. [2019-10-15 01:03:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:03:54,289 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2019-10-15 01:03:54,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:03:54,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-15 01:03:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:03:54,292 INFO L225 Difference]: With dead ends: 74 [2019-10-15 01:03:54,292 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 01:03:54,295 INFO L600 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-10-15 01:03:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 01:03:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-15 01:03:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-15 01:03:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-10-15 01:03:54,306 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 38 [2019-10-15 01:03:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:03:54,307 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-10-15 01:03:54,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:03:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-10-15 01:03:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:03:54,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:03:54,311 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:03:54,311 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:03:54,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:03:54,312 INFO L82 PathProgramCache]: Analyzing trace with hash 297259480, now seen corresponding path program 1 times [2019-10-15 01:03:54,312 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:03:54,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281277065] [2019-10-15 01:03:54,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:03:54,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:03:54,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:03:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:03:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:03:56,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281277065] [2019-10-15 01:03:56,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301585080] [2019-10-15 01:03:56,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:03:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:03:56,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 125 conjunts are in the unsatisfiable core [2019-10-15 01:03:56,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:03:56,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-15 01:03:56,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:56,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:56,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:03:56,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-15 01:03:56,632 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 13 treesize of output 9 [2019-10-15 01:03:56,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:56,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:56,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:03:56,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-10-15 01:03:56,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:56,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-15 01:03:56,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:56,763 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.6 percent of original size [2019-10-15 01:03:56,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:03:56,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2019-10-15 01:03:56,848 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 30 treesize of output 14 [2019-10-15 01:03:56,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:56,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:56,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:03:56,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2019-10-15 01:03:56,940 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 30 treesize of output 14 [2019-10-15 01:03:56,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:56,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:56,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:56,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2019-10-15 01:03:57,269 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 15 treesize of output 7 [2019-10-15 01:03:57,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:57,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:57,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-15 01:03:57,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:57,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:57,346 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 38 treesize of output 22 [2019-10-15 01:03:57,347 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:57,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:57,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2019-10-15 01:03:57,370 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 01:03:57,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:57,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:03:57,382 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:74, output treesize:13 [2019-10-15 01:03:57,482 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:57,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:03:57,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-15 01:03:57,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:71 [2019-10-15 01:04:05,606 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2019-10-15 01:04:09,725 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 48 [2019-10-15 01:04:09,982 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_36|], 10=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]} [2019-10-15 01:04:09,990 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:04:10,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:10,063 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:04:10,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:10,168 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:04:10,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:10,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-10-15 01:04:10,233 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:233, output treesize:558 [2019-10-15 01:04:27,012 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-15 01:04:27,057 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:27,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-15 01:04:27,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:04:27,285 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-15 01:04:27,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:27,289 INFO L392 ElimStorePlain]: Different costs {8=[|v_#memory_int_BEFORE_CALL_4|], 20=[|v_#memory_$Pointer$.offset_BEFORE_CALL_4|, |v_old(#memory_$Pointer$.base)_AFTER_CALL_5|]} [2019-10-15 01:04:27,302 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 01:04:27,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:04:27,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:04:27,359 INFO L341 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2019-10-15 01:04:27,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 85 [2019-10-15 01:04:27,360 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:04:27,518 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-15 01:04:27,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:27,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:04:27,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:04:27,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:04:27,749 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-10-15 01:04:27,749 INFO L341 Elim1Store]: treesize reduction 78, result has 77.5 percent of original size [2019-10-15 01:04:27,750 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 346 treesize of output 453 [2019-10-15 01:04:27,753 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 01:04:28,012 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2019-10-15 01:04:28,012 INFO L567 ElimStorePlain]: treesize reduction 211, result has 60.6 percent of original size [2019-10-15 01:04:28,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:04:28,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:04:28,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:04:28,178 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-15 01:04:28,179 INFO L341 Elim1Store]: treesize reduction 44, result has 74.0 percent of original size [2019-10-15 01:04:28,180 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 165 treesize of output 176 [2019-10-15 01:04:28,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:28,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:28,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,189 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 01:04:28,538 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-10-15 01:04:28,539 INFO L567 ElimStorePlain]: treesize reduction 520, result has 39.7 percent of original size [2019-10-15 01:04:28,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:28,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:28,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:28,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:28,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:28,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:04:28,571 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 15 variables, input treesize:624, output treesize:1038 [2019-10-15 01:04:28,815 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 1=[|#memory_$Pointer$.base|]} [2019-10-15 01:04:28,819 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-10-15 01:04:28,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:04:28,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:28,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:28,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 43 [2019-10-15 01:04:28,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:28,853 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:04:28,874 INFO L567 ElimStorePlain]: treesize reduction 4, result has 86.7 percent of original size [2019-10-15 01:04:28,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:04:28,875 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:21 [2019-10-15 01:04:28,926 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-10-15 01:04:28,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:04:28,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:28,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:04:28,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-15 01:04:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:28,952 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:04:29,643 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-10-15 01:04:29,813 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-10-15 01:04:30,098 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-10-15 01:04:30,365 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-10-15 01:04:30,375 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_61|, |v_#memory_int_59|], 4=[|v_#memory_int_60|], 8=[|v_#memory_$Pointer$.offset_54|, |v_#memory_$Pointer$.base_54|]} [2019-10-15 01:04:30,383 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:04:30,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:30,435 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:04:30,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:30,491 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:04:30,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:30,536 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:04:30,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:30,586 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 01:04:30,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:04:30,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 5 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-10-15 01:04:30,616 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 11 variables, input treesize:258, output treesize:562