java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:11:52,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:11:52,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:11:52,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:11:52,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:11:52,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:11:52,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:11:52,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:11:52,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:11:52,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:11:52,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:11:52,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:11:52,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:11:52,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:11:52,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:11:52,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:11:52,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:11:52,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:11:52,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:11:52,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:11:52,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:11:52,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:11:52,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:11:52,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:11:52,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:11:52,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:11:52,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:11:52,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:11:52,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:11:52,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:11:52,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:11:52,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:11:52,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:11:52,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:11:52,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:11:52,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:11:52,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:11:52,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:11:52,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:11:52,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:11:52,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:11:52,764 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-14 23:11:52,778 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:11:52,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:11:52,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:11:52,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:11:52,780 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:11:52,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:11:52,780 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:11:52,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:11:52,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:11:52,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:11:52,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:11:52,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:11:52,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:11:52,781 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:11:52,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:11:52,782 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:11:52,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:11:52,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:11:52,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:11:52,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:11:52,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:11:52,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:11:52,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:11:52,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:11:52,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:11:52,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:11:52,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:11:52,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:11:52,784 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:11:53,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:11:53,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:11:53,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:11:53,108 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:11:53,109 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:11:53,110 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2019-10-14 23:11:53,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a54e8de5/0ad17bdbec6c4fa0a77b2e39c1f5bb87/FLAG6255562e0 [2019-10-14 23:11:53,701 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:11:53,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2019-10-14 23:11:53,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a54e8de5/0ad17bdbec6c4fa0a77b2e39c1f5bb87/FLAG6255562e0 [2019-10-14 23:11:53,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a54e8de5/0ad17bdbec6c4fa0a77b2e39c1f5bb87 [2019-10-14 23:11:53,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:11:54,001 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:11:54,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:11:54,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:11:54,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:11:54,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:53" (1/1) ... [2019-10-14 23:11:54,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e00561b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54, skipping insertion in model container [2019-10-14 23:11:54,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:53" (1/1) ... [2019-10-14 23:11:54,021 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:11:54,071 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:11:54,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:11:54,598 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:11:54,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:11:54,712 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:11:54,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54 WrapperNode [2019-10-14 23:11:54,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:11:54,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:11:54,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:11:54,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:11:54,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (1/1) ... [2019-10-14 23:11:54,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:11:54,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:11:54,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:11:54,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:11:54,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (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-14 23:11:54,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:11:54,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:11:54,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:11:54,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:11:54,845 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:11:54,846 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-14 23:11:54,846 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-10-14 23:11:54,846 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-10-14 23:11:54,846 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-10-14 23:11:54,846 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-10-14 23:11:54,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:11:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:11:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:11:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:11:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:11:54,848 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:11:54,848 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:11:54,848 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:11:54,848 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:11:54,848 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:11:54,848 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:11:54,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:11:54,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:11:54,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:11:54,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:11:54,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:11:54,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:11:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:11:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:11:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:11:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:11:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:11:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:11:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:11:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:11:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:11:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:11:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:11:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:11:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:11:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:11:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:11:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:11:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:11:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:11:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:11:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:11:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:11:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:11:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:11:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:11:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:11:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:11:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:11:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:11:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:11:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:11:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:11:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:11:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:11:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:11:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:11:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:11:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:11:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:11:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:11:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:11:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:11:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 23:11:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:11:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:11:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:11:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:11:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:11:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:11:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:11:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:11:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:11:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:11:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:11:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:11:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:11:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:11:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:11:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:11:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:11:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:11:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:11:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:11:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:11:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:11:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:11:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:11:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:11:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:11:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:11:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:11:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:11:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:11:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:11:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:11:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:11:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:11:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:11:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:11:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:11:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:11:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:11:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:11:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:11:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:11:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:11:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:11:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:11:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:11:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:11:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:11:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:11:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-14 23:11:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:11:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:11:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:11:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-10-14 23:11:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-10-14 23:11:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:11:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:11:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-10-14 23:11:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:11:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-10-14 23:11:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:11:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:11:54,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:11:55,360 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:11:55,488 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:11:55,488 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-14 23:11:55,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:55 BoogieIcfgContainer [2019-10-14 23:11:55,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:11:55,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:11:55,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:11:55,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:11:55,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:11:53" (1/3) ... [2019-10-14 23:11:55,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfe055e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:55, skipping insertion in model container [2019-10-14 23:11:55,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:54" (2/3) ... [2019-10-14 23:11:55,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfe055e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:55, skipping insertion in model container [2019-10-14 23:11:55,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:55" (3/3) ... [2019-10-14 23:11:55,498 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2019-10-14 23:11:55,509 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:11:55,517 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:11:55,529 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:11:55,557 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:11:55,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:11:55,558 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:11:55,558 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:11:55,558 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:11:55,558 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:11:55,558 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:11:55,559 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:11:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-10-14 23:11:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:11:55,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:55,582 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:55,584 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1661227511, now seen corresponding path program 1 times [2019-10-14 23:11:55,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:55,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805783002] [2019-10-14 23:11:55,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:55,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:55,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:55,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805783002] [2019-10-14 23:11:55,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:55,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:11:55,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109166089] [2019-10-14 23:11:55,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:11:55,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:55,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:11:55,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:11:55,959 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 4 states. [2019-10-14 23:11:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:56,249 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2019-10-14 23:11:56,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:11:56,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-14 23:11:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:56,261 INFO L225 Difference]: With dead ends: 101 [2019-10-14 23:11:56,261 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 23:11:56,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-10-14 23:11:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 23:11:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-14 23:11:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-14 23:11:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-10-14 23:11:56,315 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2019-10-14 23:11:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:56,317 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-10-14 23:11:56,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:11:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-10-14 23:11:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:11:56,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:56,322 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:56,322 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:56,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:56,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1248070634, now seen corresponding path program 1 times [2019-10-14 23:11:56,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:56,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036899488] [2019-10-14 23:11:56,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:56,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:56,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:56,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036899488] [2019-10-14 23:11:56,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:56,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:11:56,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148283158] [2019-10-14 23:11:56,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:11:56,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:56,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:11:56,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:11:56,518 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 6 states. [2019-10-14 23:11:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:56,784 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-10-14 23:11:56,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:11:56,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-10-14 23:11:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:56,787 INFO L225 Difference]: With dead ends: 68 [2019-10-14 23:11:56,787 INFO L226 Difference]: Without dead ends: 55 [2019-10-14 23:11:56,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:11:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-14 23:11:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2019-10-14 23:11:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 23:11:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-10-14 23:11:56,806 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2019-10-14 23:11:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:56,807 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-10-14 23:11:56,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:11:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-10-14 23:11:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 23:11:56,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:56,811 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:56,812 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:56,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2064355028, now seen corresponding path program 1 times [2019-10-14 23:11:56,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:56,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172085383] [2019-10-14 23:11:56,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:56,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:56,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:57,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172085383] [2019-10-14 23:11:57,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463540655] [2019-10-14 23:11:57,273 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-14 23:11:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:11:57,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:11:57,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:11:57,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 17 [2019-10-14 23:11:57,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346048297] [2019-10-14 23:11:57,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:11:57,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:57,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:11:57,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:11:57,516 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 5 states. [2019-10-14 23:11:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:57,606 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2019-10-14 23:11:57,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:11:57,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-14 23:11:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:57,608 INFO L225 Difference]: With dead ends: 77 [2019-10-14 23:11:57,608 INFO L226 Difference]: Without dead ends: 51 [2019-10-14 23:11:57,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:11:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-14 23:11:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-10-14 23:11:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-14 23:11:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-10-14 23:11:57,618 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 40 [2019-10-14 23:11:57,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:57,619 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-10-14 23:11:57,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:11:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-10-14 23:11:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 23:11:57,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:57,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:57,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:57,824 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:57,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:57,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1202630968, now seen corresponding path program 1 times [2019-10-14 23:11:57,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:57,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188177590] [2019-10-14 23:11:57,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:57,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:57,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 23:11:58,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188177590] [2019-10-14 23:11:58,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762146228] [2019-10-14 23:11:58,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:11:58,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 23:11:58,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:11:58,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 15 [2019-10-14 23:11:58,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259356478] [2019-10-14 23:11:58,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:11:58,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:58,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:11:58,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:11:58,286 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2019-10-14 23:11:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:58,382 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2019-10-14 23:11:58,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:11:58,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-10-14 23:11:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:58,387 INFO L225 Difference]: With dead ends: 81 [2019-10-14 23:11:58,387 INFO L226 Difference]: Without dead ends: 60 [2019-10-14 23:11:58,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:11:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-14 23:11:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-10-14 23:11:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-14 23:11:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-10-14 23:11:58,403 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 50 [2019-10-14 23:11:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:58,403 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-10-14 23:11:58,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:11:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-10-14 23:11:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 23:11:58,405 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:58,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:58,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:58,612 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1117742799, now seen corresponding path program 1 times [2019-10-14 23:11:58,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:58,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645712536] [2019-10-14 23:11:58,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:58,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:58,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:58,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645712536] [2019-10-14 23:11:58,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950420248] [2019-10-14 23:11:58,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:58,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:11:58,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:58,988 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:58,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 14 [2019-10-14 23:11:58,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144788920] [2019-10-14 23:11:58,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:11:58,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:58,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:11:58,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:11:58,990 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 14 states. [2019-10-14 23:11:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:59,488 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2019-10-14 23:11:59,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:11:59,488 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2019-10-14 23:11:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:59,490 INFO L225 Difference]: With dead ends: 79 [2019-10-14 23:11:59,491 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 23:11:59,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:11:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 23:11:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2019-10-14 23:11:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-14 23:11:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-10-14 23:11:59,506 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 51 [2019-10-14 23:11:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:59,506 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-10-14 23:11:59,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:11:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-10-14 23:11:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:11:59,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:59,509 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:59,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:59,710 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:59,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:59,710 INFO L82 PathProgramCache]: Analyzing trace with hash -475790904, now seen corresponding path program 1 times [2019-10-14 23:11:59,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:59,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627934160] [2019-10-14 23:11:59,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:59,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:59,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:12:01,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627934160] [2019-10-14 23:12:01,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210736794] [2019-10-14 23:12:01,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:12:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:12:01,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 108 conjunts are in the unsatisfiable core [2019-10-14 23:12:01,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:12:01,848 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-14 23:12:01,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:01,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:01,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:01,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:12:02,253 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:02,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:12:02,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:02,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:02,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:02,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-14 23:12:02,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:12:02,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:02,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:02,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:02,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-14 23:12:02,394 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 21 treesize of output 20 [2019-10-14 23:12:02,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:02,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:02,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:12:02,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-10-14 23:12:02,587 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_28|], 10=[|v_#memory_$Pointer$.base_30|]} [2019-10-14 23:12:02,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2019-10-14 23:12:02,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:02,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:02,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:02,732 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-14 23:12:02,732 INFO L341 Elim1Store]: treesize reduction 43, result has 72.4 percent of original size [2019-10-14 23:12:02,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 139 [2019-10-14 23:12:02,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:02,776 INFO L567 ElimStorePlain]: treesize reduction 155, result has 32.3 percent of original size [2019-10-14 23:12:02,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:12:02,778 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:116, output treesize:77 [2019-10-14 23:12:04,891 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-10-14 23:12:06,999 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-10-14 23:12:09,153 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 33 [2019-10-14 23:12:11,323 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 34 [2019-10-14 23:12:11,478 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 25 treesize of output 17 [2019-10-14 23:12:11,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:11,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:11,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:12:11,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2019-10-14 23:12:11,601 INFO L392 ElimStorePlain]: Different costs {12=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_15|], 20=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_15|]} [2019-10-14 23:12:11,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:11,624 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:11,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 155 [2019-10-14 23:12:11,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:11,684 INFO L567 ElimStorePlain]: treesize reduction 50, result has 75.7 percent of original size [2019-10-14 23:12:11,998 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-10-14 23:12:11,999 INFO L341 Elim1Store]: treesize reduction 10, result has 97.1 percent of original size [2019-10-14 23:12:12,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 425 [2019-10-14 23:12:12,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:12:12,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:12,477 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2019-10-14 23:12:14,053 WARN L191 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 197 DAG size of output: 48 [2019-10-14 23:12:14,053 INFO L567 ElimStorePlain]: treesize reduction 32479, result has 0.7 percent of original size [2019-10-14 23:12:14,054 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-14 23:12:14,055 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:180 [2019-10-14 23:12:15,763 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_int)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_dll_circular_update_at_#in~head.base|) .cse0 dll_circular_update_at_~data)) |c_#memory_int|) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset)))) is different from true [2019-10-14 23:12:15,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:15,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:15,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:15,818 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_int)_AFTER_CALL_16|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|]} [2019-10-14 23:12:15,836 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 134 treesize of output 133 [2019-10-14 23:12:15,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:15,851 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 115 treesize of output 114 [2019-10-14 23:12:15,852 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:15,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:15,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:15,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:15,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:16,038 INFO L341 Elim1Store]: treesize reduction 36, result has 65.4 percent of original size [2019-10-14 23:12:16,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 161 [2019-10-14 23:12:16,041 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:16,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:16,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:16,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:16,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 90 [2019-10-14 23:12:16,059 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:16,196 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-14 23:12:16,196 INFO L567 ElimStorePlain]: treesize reduction 74, result has 73.4 percent of original size [2019-10-14 23:12:16,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:16,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:16,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:16,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 75 [2019-10-14 23:12:16,220 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:16,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:16,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:16,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:12:16,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 98 [2019-10-14 23:12:16,246 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 23:12:16,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:12:16,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 23:12:16,304 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:250, output treesize:142 [2019-10-14 23:12:16,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:12:16,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms