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/forester-heap/dll-circular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 18:07:33,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 18:07:33,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 18:07:33,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 18:07:33,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 18:07:33,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 18:07:33,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 18:07:33,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 18:07:33,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 18:07:33,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 18:07:33,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 18:07:33,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 18:07:33,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 18:07:33,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 18:07:33,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 18:07:33,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 18:07:33,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 18:07:33,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 18:07:33,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 18:07:33,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 18:07:33,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 18:07:33,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 18:07:33,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 18:07:33,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 18:07:33,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 18:07:33,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 18:07:33,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 18:07:33,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 18:07:33,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 18:07:33,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 18:07:33,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 18:07:33,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 18:07:33,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 18:07:33,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 18:07:33,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 18:07:33,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 18:07:33,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 18:07:33,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 18:07:33,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 18:07:33,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 18:07:33,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 18:07:33,844 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-13 18:07:33,870 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 18:07:33,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 18:07:33,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 18:07:33,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 18:07:33,872 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 18:07:33,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 18:07:33,872 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 18:07:33,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 18:07:33,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 18:07:33,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 18:07:33,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 18:07:33,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 18:07:33,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 18:07:33,874 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 18:07:33,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 18:07:33,874 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 18:07:33,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 18:07:33,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 18:07:33,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 18:07:33,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 18:07:33,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 18:07:33,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:07:33,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 18:07:33,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 18:07:33,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 18:07:33,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 18:07:33,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 18:07:33,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 18:07:33,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 18:07:34,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 18:07:34,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 18:07:34,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 18:07:34,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 18:07:34,169 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 18:07:34,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-10-13 18:07:34,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ae68c67/5eeaa7709b4c4031934669ca90fdd7a7/FLAGb4e982e6b [2019-10-13 18:07:34,802 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 18:07:34,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-10-13 18:07:34,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ae68c67/5eeaa7709b4c4031934669ca90fdd7a7/FLAGb4e982e6b [2019-10-13 18:07:35,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ae68c67/5eeaa7709b4c4031934669ca90fdd7a7 [2019-10-13 18:07:35,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 18:07:35,135 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 18:07:35,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 18:07:35,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 18:07:35,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 18:07:35,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:07:35" (1/1) ... [2019-10-13 18:07:35,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d5ae8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:35, skipping insertion in model container [2019-10-13 18:07:35,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:07:35" (1/1) ... [2019-10-13 18:07:35,152 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 18:07:35,211 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 18:07:35,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:07:35,638 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 18:07:35,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:07:35,741 INFO L192 MainTranslator]: Completed translation [2019-10-13 18:07:35,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:35 WrapperNode [2019-10-13 18:07:35,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 18:07:35,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 18:07:35,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 18:07:35,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 18:07:35,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:35" (1/1) ... [2019-10-13 18:07:35,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:35" (1/1) ... [2019-10-13 18:07:35,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:35" (1/1) ... [2019-10-13 18:07:35,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:35" (1/1) ... [2019-10-13 18:07:35,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:35" (1/1) ... [2019-10-13 18:07:35,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:35" (1/1) ... [2019-10-13 18:07:35,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:35" (1/1) ... [2019-10-13 18:07:35,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 18:07:35,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 18:07:35,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 18:07:35,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 18:07:35,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:35" (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-13 18:07:35,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 18:07:35,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 18:07:35,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 18:07:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 18:07:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 18:07:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 18:07:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 18:07:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 18:07:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 18:07:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 18:07:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 18:07:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 18:07:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 18:07:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 18:07:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 18:07:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 18:07:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 18:07:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 18:07:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 18:07:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 18:07:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 18:07:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 18:07:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 18:07:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 18:07:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 18:07:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 18:07:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 18:07:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 18:07:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 18:07:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 18:07:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 18:07:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 18:07:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 18:07:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 18:07:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 18:07:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 18:07:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 18:07:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 18:07:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 18:07:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 18:07:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 18:07:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 18:07:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 18:07:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 18:07:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 18:07:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 18:07:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 18:07:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 18:07:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 18:07:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 18:07:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 18:07:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 18:07:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 18:07:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 18:07:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 18:07:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 18:07:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 18:07:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 18:07:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 18:07:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 18:07:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 18:07:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 18:07:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 18:07:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 18:07:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 18:07:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 18:07:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 18:07:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 18:07:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 18:07:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 18:07:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 18:07:35,883 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 18:07:35,883 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 18:07:35,883 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 18:07:35,883 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 18:07:35,883 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 18:07:35,883 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 18:07:35,883 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 18:07:35,884 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 18:07:35,884 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 18:07:35,884 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 18:07:35,884 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 18:07:35,884 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 18:07:35,884 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 18:07:35,885 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 18:07:35,885 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 18:07:35,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 18:07:35,885 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 18:07:35,885 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 18:07:35,885 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 18:07:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 18:07:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 18:07:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 18:07:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 18:07:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 18:07:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 18:07:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 18:07:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 18:07:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 18:07:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 18:07:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 18:07:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 18:07:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 18:07:35,888 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 18:07:35,888 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 18:07:35,888 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 18:07:35,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 18:07:35,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 18:07:35,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 18:07:35,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 18:07:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 18:07:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 18:07:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 18:07:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 18:07:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 18:07:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 18:07:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 18:07:36,463 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 18:07:36,464 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-13 18:07:36,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:07:36 BoogieIcfgContainer [2019-10-13 18:07:36,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 18:07:36,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 18:07:36,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 18:07:36,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 18:07:36,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:07:35" (1/3) ... [2019-10-13 18:07:36,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba35b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:07:36, skipping insertion in model container [2019-10-13 18:07:36,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:35" (2/3) ... [2019-10-13 18:07:36,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba35b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:07:36, skipping insertion in model container [2019-10-13 18:07:36,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:07:36" (3/3) ... [2019-10-13 18:07:36,474 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2019-10-13 18:07:36,484 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 18:07:36,494 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-13 18:07:36,506 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-13 18:07:36,531 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 18:07:36,531 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 18:07:36,531 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 18:07:36,531 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 18:07:36,532 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 18:07:36,532 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 18:07:36,532 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 18:07:36,532 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 18:07:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-13 18:07:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 18:07:36,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:07:36,559 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:07:36,561 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:07:36,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:07:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1483997276, now seen corresponding path program 1 times [2019-10-13 18:07:36,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:07:36,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654048407] [2019-10-13 18:07:36,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:36,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:36,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:07:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:36,815 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-13 18:07:36,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654048407] [2019-10-13 18:07:36,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:07:36,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 18:07:36,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942477200] [2019-10-13 18:07:36,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 18:07:36,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:07:36,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 18:07:36,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 18:07:36,852 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-10-13 18:07:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:07:37,010 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2019-10-13 18:07:37,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 18:07:37,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-13 18:07:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:07:37,022 INFO L225 Difference]: With dead ends: 70 [2019-10-13 18:07:37,023 INFO L226 Difference]: Without dead ends: 30 [2019-10-13 18:07:37,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 18:07:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-13 18:07:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-13 18:07:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 18:07:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-13 18:07:37,099 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2019-10-13 18:07:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:07:37,100 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-13 18:07:37,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 18:07:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-13 18:07:37,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 18:07:37,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:07:37,101 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:07:37,101 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:07:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:07:37,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1199756337, now seen corresponding path program 1 times [2019-10-13 18:07:37,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:07:37,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346163506] [2019-10-13 18:07:37,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:37,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:37,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:07:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:37,324 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-13 18:07:37,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346163506] [2019-10-13 18:07:37,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:07:37,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 18:07:37,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000782764] [2019-10-13 18:07:37,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 18:07:37,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:07:37,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 18:07:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 18:07:37,329 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-10-13 18:07:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:07:37,490 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-13 18:07:37,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 18:07:37,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-13 18:07:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:07:37,492 INFO L225 Difference]: With dead ends: 46 [2019-10-13 18:07:37,492 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 18:07:37,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:07:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 18:07:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-10-13 18:07:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 18:07:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-13 18:07:37,501 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2019-10-13 18:07:37,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:07:37,502 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-13 18:07:37,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 18:07:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-10-13 18:07:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 18:07:37,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:07:37,503 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:07:37,503 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:07:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:07:37,504 INFO L82 PathProgramCache]: Analyzing trace with hash -97127833, now seen corresponding path program 1 times [2019-10-13 18:07:37,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:07:37,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17461410] [2019-10-13 18:07:37,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:37,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:37,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:07:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:37,570 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-13 18:07:37,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17461410] [2019-10-13 18:07:37,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:07:37,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 18:07:37,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342109452] [2019-10-13 18:07:37,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 18:07:37,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:07:37,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 18:07:37,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:07:37,575 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 4 states. [2019-10-13 18:07:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:07:37,654 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-10-13 18:07:37,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 18:07:37,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-13 18:07:37,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:07:37,657 INFO L225 Difference]: With dead ends: 75 [2019-10-13 18:07:37,658 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 18:07:37,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:07:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 18:07:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-10-13 18:07:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 18:07:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-10-13 18:07:37,667 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2019-10-13 18:07:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:07:37,668 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-13 18:07:37,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 18:07:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-10-13 18:07:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 18:07:37,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:07:37,669 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:07:37,669 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:07:37,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:07:37,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2075944349, now seen corresponding path program 1 times [2019-10-13 18:07:37,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:07:37,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15784084] [2019-10-13 18:07:37,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:37,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:37,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:07:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:37,750 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-13 18:07:37,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15784084] [2019-10-13 18:07:37,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:07:37,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 18:07:37,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213895443] [2019-10-13 18:07:37,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 18:07:37,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:07:37,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 18:07:37,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:07:37,753 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 4 states. [2019-10-13 18:07:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:07:37,850 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-10-13 18:07:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 18:07:37,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-13 18:07:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:07:37,851 INFO L225 Difference]: With dead ends: 42 [2019-10-13 18:07:37,852 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 18:07:37,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:07:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 18:07:37,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-13 18:07:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 18:07:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-13 18:07:37,866 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2019-10-13 18:07:37,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:07:37,866 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-13 18:07:37,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 18:07:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-10-13 18:07:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 18:07:37,869 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:07:37,869 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:07:37,870 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:07:37,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:07:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2075946271, now seen corresponding path program 1 times [2019-10-13 18:07:37,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:07:37,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725122133] [2019-10-13 18:07:37,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:37,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:37,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:07:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:38,112 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-13 18:07:38,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725122133] [2019-10-13 18:07:38,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:07:38,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 18:07:38,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029908099] [2019-10-13 18:07:38,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 18:07:38,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:07:38,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 18:07:38,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:07:38,115 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2019-10-13 18:07:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:07:38,402 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-10-13 18:07:38,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:07:38,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 18:07:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:07:38,404 INFO L225 Difference]: With dead ends: 51 [2019-10-13 18:07:38,405 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 18:07:38,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 18:07:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 18:07:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-13 18:07:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 18:07:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-10-13 18:07:38,413 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2019-10-13 18:07:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:07:38,413 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-13 18:07:38,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 18:07:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-10-13 18:07:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 18:07:38,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:07:38,414 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:07:38,415 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:07:38,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:07:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash -351040154, now seen corresponding path program 1 times [2019-10-13 18:07:38,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:07:38,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339532345] [2019-10-13 18:07:38,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:38,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:38,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:07:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:07:38,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339532345] [2019-10-13 18:07:38,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709653491] [2019-10-13 18:07:38,550 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-13 18:07:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:38,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 18:07:38,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:07:38,772 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-13 18:07:38,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:38,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:38,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:07:38,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 18:07:38,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:38,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 18:07:38,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:38,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:38,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:07:38,899 INFO L341 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-10-13 18:07:38,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 51 [2019-10-13 18:07:38,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:38,933 INFO L567 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-10-13 18:07:38,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:07:38,935 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:32 [2019-10-13 18:07:40,982 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-13 18:07:41,038 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-10-13 18:07:41,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, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 41 [2019-10-13 18:07:41,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:41,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:41,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:07:41,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:23 [2019-10-13 18:07:43,107 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_22|]} [2019-10-13 18:07:43,112 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:07:43,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:43,138 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:43,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-10-13 18:07:43,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:43,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:43,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:43,178 INFO L567 ElimStorePlain]: treesize reduction 19, result has 32.1 percent of original size [2019-10-13 18:07:43,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:07:43,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-10-13 18:07:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:07:43,181 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:07:43,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-10-13 18:07:43,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352509355] [2019-10-13 18:07:43,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 18:07:43,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:07:43,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 18:07:43,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2019-10-13 18:07:43,183 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 8 states. [2019-10-13 18:07:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:07:53,414 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-10-13 18:07:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 18:07:53,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-13 18:07:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:07:53,416 INFO L225 Difference]: With dead ends: 65 [2019-10-13 18:07:53,417 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 18:07:53,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2019-10-13 18:07:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 18:07:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-10-13 18:07:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 18:07:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-10-13 18:07:53,428 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 17 [2019-10-13 18:07:53,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:07:53,428 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-10-13 18:07:53,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 18:07:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-10-13 18:07:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 18:07:53,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:07:53,429 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:07:53,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:07:53,631 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:07:53,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:07:53,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2111834143, now seen corresponding path program 1 times [2019-10-13 18:07:53,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:07:53,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592206794] [2019-10-13 18:07:53,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:53,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:53,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:07:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:07:53,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592206794] [2019-10-13 18:07:53,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:07:53,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 18:07:53,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656511517] [2019-10-13 18:07:53,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 18:07:53,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:07:53,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 18:07:53,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:07:53,681 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 4 states. [2019-10-13 18:07:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:07:53,789 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2019-10-13 18:07:53,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 18:07:53,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-13 18:07:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:07:53,791 INFO L225 Difference]: With dead ends: 100 [2019-10-13 18:07:53,791 INFO L226 Difference]: Without dead ends: 77 [2019-10-13 18:07:53,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:07:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-13 18:07:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-10-13 18:07:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 18:07:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2019-10-13 18:07:53,799 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 21 [2019-10-13 18:07:53,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:07:53,799 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2019-10-13 18:07:53,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 18:07:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2019-10-13 18:07:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 18:07:53,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:07:53,801 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:07:53,801 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:07:53,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:07:53,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2016892268, now seen corresponding path program 1 times [2019-10-13 18:07:53,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:07:53,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510502736] [2019-10-13 18:07:53,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:53,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:53,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:07:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:07:54,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510502736] [2019-10-13 18:07:54,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434743235] [2019-10-13 18:07:54,153 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-13 18:07:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:54,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-13 18:07:54,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:07:54,267 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-13 18:07:54,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 18:07:54,294 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,303 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2019-10-13 18:07:54,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,363 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-13 18:07:54,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,440 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_26|, |v_#memory_int_24|, |v_#memory_int_25|], 8=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_20|]} [2019-10-13 18:07:54,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:07:54,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-13 18:07:54,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,525 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 25 treesize of output 13 [2019-10-13 18:07:54,525 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:07:54,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-13 18:07:54,577 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:07:54,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:07:54,654 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2019-10-13 18:07:54,655 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,716 INFO L567 ElimStorePlain]: treesize reduction 24, result has 84.2 percent of original size [2019-10-13 18:07:54,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:07:54,732 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-10-13 18:07:54,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 25 [2019-10-13 18:07:54,733 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,756 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:245, output treesize:59 [2019-10-13 18:07:54,795 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_27|], 12=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_21|]} [2019-10-13 18:07:54,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-13 18:07:54,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:07:54,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:07:54,873 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-10-13 18:07:54,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:07:54,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:07:54,916 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-10-13 18:07:54,917 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:54,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:07:54,943 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:110, output treesize:68 [2019-10-13 18:07:55,008 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_28|], 6=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_22|]} [2019-10-13 18:07:55,017 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-10-13 18:07:55,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:55,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:55,079 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:55,080 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 4 case distinctions, treesize of input 107 treesize of output 127 [2019-10-13 18:07:55,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:07:55,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:07:55,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,101 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2019-10-13 18:07:55,239 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-10-13 18:07:55,240 INFO L567 ElimStorePlain]: treesize reduction 1277, result has 8.0 percent of original size [2019-10-13 18:07:55,247 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 69 [2019-10-13 18:07:55,249 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:55,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:55,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:07:55,277 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:164, output treesize:83 [2019-10-13 18:07:55,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:07:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:07:55,348 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:07:55,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-13 18:07:55,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976046595] [2019-10-13 18:07:55,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 18:07:55,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:07:55,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 18:07:55,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-13 18:07:55,350 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 13 states. [2019-10-13 18:07:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:07:55,977 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-10-13 18:07:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 18:07:55,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-10-13 18:07:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:07:55,978 INFO L225 Difference]: With dead ends: 86 [2019-10-13 18:07:55,978 INFO L226 Difference]: Without dead ends: 76 [2019-10-13 18:07:55,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-13 18:07:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-13 18:07:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-10-13 18:07:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-13 18:07:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-10-13 18:07:55,987 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 23 [2019-10-13 18:07:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:07:55,987 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-10-13 18:07:55,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 18:07:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-10-13 18:07:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 18:07:55,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:07:55,988 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:07:56,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:07:56,191 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:07:56,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:07:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash -148911397, now seen corresponding path program 2 times [2019-10-13 18:07:56,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:07:56,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288579961] [2019-10-13 18:07:56,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:56,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:56,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:07:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:07:56,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288579961] [2019-10-13 18:07:56,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026977713] [2019-10-13 18:07:56,348 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-13 18:07:56,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 18:07:56,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:07:56,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-13 18:07:56,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:07:56,462 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-13 18:07:56,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:56,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:56,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:07:56,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:07:56,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:56,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:07:56,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:56,569 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.4 percent of original size [2019-10-13 18:07:56,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:07:56,615 INFO L341 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-10-13 18:07:56,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 51 [2019-10-13 18:07:56,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:56,660 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.7 percent of original size [2019-10-13 18:07:56,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:07:56,662 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:120, output treesize:45 [2019-10-13 18:07:58,687 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2019-10-13 18:07:58,731 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-10-13 18:07:58,732 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 41 [2019-10-13 18:07:58,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:07:58,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:07:58,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:07:58,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:36 [2019-10-13 18:08:00,820 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:00,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-13 18:08:00,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:00,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:01,043 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-10-13 18:08:01,044 INFO L341 Elim1Store]: treesize reduction 25, result has 86.0 percent of original size [2019-10-13 18:08:01,045 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 5 case distinctions, treesize of input 179 treesize of output 206 [2019-10-13 18:08:01,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:01,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:01,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:01,111 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:01,234 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-10-13 18:08:01,235 INFO L567 ElimStorePlain]: treesize reduction 148, result has 28.5 percent of original size [2019-10-13 18:08:01,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:01,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:210, output treesize:93 [2019-10-13 18:08:01,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:01,474 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-10-13 18:08:01,475 INFO L341 Elim1Store]: treesize reduction 48, result has 59.7 percent of original size [2019-10-13 18:08:01,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 106 [2019-10-13 18:08:01,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,485 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:01,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:01,721 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-10-13 18:08:01,722 INFO L341 Elim1Store]: treesize reduction 76, result has 63.8 percent of original size [2019-10-13 18:08:01,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 106 treesize of output 175 [2019-10-13 18:08:01,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,740 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:01,887 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-10-13 18:08:01,888 INFO L567 ElimStorePlain]: treesize reduction 136, result has 42.4 percent of original size [2019-10-13 18:08:01,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:01,891 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:192, output treesize:50 [2019-10-13 18:08:01,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:01,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,073 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 20=[|v_#memory_$Pointer$.base_30|]} [2019-10-13 18:08:02,076 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:02,080 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:02,118 INFO L567 ElimStorePlain]: treesize reduction 139, result has 44.0 percent of original size [2019-10-13 18:08:02,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:02,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 90 [2019-10-13 18:08:02,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:02,160 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:02,179 INFO L567 ElimStorePlain]: treesize reduction 39, result has 30.4 percent of original size [2019-10-13 18:08:02,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:02,180 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:266, output treesize:4 [2019-10-13 18:08:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:02,184 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:02,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-10-13 18:08:02,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012255762] [2019-10-13 18:08:02,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 18:08:02,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:02,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 18:08:02,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=77, Unknown=3, NotChecked=0, Total=110 [2019-10-13 18:08:02,185 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 11 states. [2019-10-13 18:08:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:12,517 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2019-10-13 18:08:12,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 18:08:12,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-10-13 18:08:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:12,518 INFO L225 Difference]: With dead ends: 103 [2019-10-13 18:08:12,518 INFO L226 Difference]: Without dead ends: 101 [2019-10-13 18:08:12,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=48, Invalid=131, Unknown=3, NotChecked=0, Total=182 [2019-10-13 18:08:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-13 18:08:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2019-10-13 18:08:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-13 18:08:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2019-10-13 18:08:12,529 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 23 [2019-10-13 18:08:12,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:12,529 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2019-10-13 18:08:12,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 18:08:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2019-10-13 18:08:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 18:08:12,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:12,533 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:12,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:12,744 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:12,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:12,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1680620617, now seen corresponding path program 2 times [2019-10-13 18:08:12,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:12,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154996341] [2019-10-13 18:08:12,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:12,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:12,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:13,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154996341] [2019-10-13 18:08:13,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847791176] [2019-10-13 18:08:13,211 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-13 18:08:13,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 18:08:13,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:08:13,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-13 18:08:13,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:13,342 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-13 18:08:13,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:13,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:13,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:13,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:08:13,386 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:13,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:08:13,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:13,494 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-13 18:08:13,494 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.4 percent of original size [2019-10-13 18:08:13,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:13,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:13,509 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:13,520 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-10-13 18:08:13,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 25 [2019-10-13 18:08:13,521 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:13,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:13,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:13,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:13,574 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:13,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2019-10-13 18:08:13,575 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:13,631 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.5 percent of original size [2019-10-13 18:08:13,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:13,633 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:63 [2019-10-13 18:08:13,688 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 12=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_32|]} [2019-10-13 18:08:13,706 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 13 treesize of output 9 [2019-10-13 18:08:13,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:13,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:13,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:13,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:13,759 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-10-13 18:08:13,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:13,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:13,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:13,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:13,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:13,807 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-10-13 18:08:13,807 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:13,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:13,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:13,837 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:72 [2019-10-13 18:08:13,971 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:13,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-13 18:08:13,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:14,310 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-13 18:08:14,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:14,317 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_29|, |v_#memory_int_32|], 2=[|v_#memory_int_30|], 24=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_33|]} [2019-10-13 18:08:14,327 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:14,582 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-13 18:08:14,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:14,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 26 [2019-10-13 18:08:14,614 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:14,728 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-13 18:08:14,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:14,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:14,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-10-13 18:08:14,743 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:14,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:14,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:14,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:14,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:14,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:14,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:14,863 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 72 [2019-10-13 18:08:14,864 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:14,975 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-13 18:08:14,975 INFO L567 ElimStorePlain]: treesize reduction 16, result has 94.4 percent of original size [2019-10-13 18:08:14,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:15,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:15,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 185 treesize of output 158 [2019-10-13 18:08:15,031 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:15,136 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-10-13 18:08:15,136 INFO L567 ElimStorePlain]: treesize reduction 114, result has 51.9 percent of original size [2019-10-13 18:08:15,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:15,138 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:446, output treesize:109 [2019-10-13 18:08:15,197 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 25=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_26|]} [2019-10-13 18:08:15,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:15,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-10-13 18:08:15,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:15,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:15,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:15,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:15,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:15,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 101 treesize of output 108 [2019-10-13 18:08:15,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:15,391 INFO L567 ElimStorePlain]: treesize reduction 72, result has 65.6 percent of original size [2019-10-13 18:08:15,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:15,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:15,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:15,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:15,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2019-10-13 18:08:15,403 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:15,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:15,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:15,439 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:160, output treesize:118 [2019-10-13 18:08:15,513 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_34|], 4=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_27|]} [2019-10-13 18:08:15,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:15,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 30 [2019-10-13 18:08:15,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:15,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:15,586 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:15,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 207 treesize of output 152 [2019-10-13 18:08:15,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,613 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:15,707 INFO L567 ElimStorePlain]: treesize reduction 96, result has 65.2 percent of original size [2019-10-13 18:08:15,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:15,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:15,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2019-10-13 18:08:15,732 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:15,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:15,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:15,766 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:263, output treesize:190 [2019-10-13 18:08:15,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:15,849 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:15,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-10-13 18:08:15,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530661128] [2019-10-13 18:08:15,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 18:08:15,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:15,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 18:08:15,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-13 18:08:15,850 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand 14 states. [2019-10-13 18:08:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:16,513 INFO L93 Difference]: Finished difference Result 118 states and 138 transitions. [2019-10-13 18:08:16,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 18:08:16,514 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-10-13 18:08:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:16,515 INFO L225 Difference]: With dead ends: 118 [2019-10-13 18:08:16,516 INFO L226 Difference]: Without dead ends: 116 [2019-10-13 18:08:16,516 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-13 18:08:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-13 18:08:16,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2019-10-13 18:08:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-13 18:08:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2019-10-13 18:08:16,526 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 29 [2019-10-13 18:08:16,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:16,527 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-10-13 18:08:16,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 18:08:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2019-10-13 18:08:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 18:08:16,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:16,528 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:16,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:16,738 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash -746365808, now seen corresponding path program 3 times [2019-10-13 18:08:16,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:16,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582272100] [2019-10-13 18:08:16,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:16,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:16,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:16,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582272100] [2019-10-13 18:08:16,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003787306] [2019-10-13 18:08:16,889 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:17,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 18:08:17,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:08:17,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-13 18:08:17,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:17,096 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-13 18:08:17,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:08:17,163 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:08:17,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,238 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.6 percent of original size [2019-10-13 18:08:17,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:17,300 INFO L341 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-10-13 18:08:17,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 51 [2019-10-13 18:08:17,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,371 INFO L567 ElimStorePlain]: treesize reduction 24, result has 68.0 percent of original size [2019-10-13 18:08:17,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:17,373 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:48 [2019-10-13 18:08:17,464 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-10-13 18:08:17,464 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 41 [2019-10-13 18:08:17,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:17,496 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-13 18:08:17,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:56 [2019-10-13 18:08:17,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:17,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:18,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms