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/heap-data/min_max.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:07:48,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:07:48,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:07:48,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:07:48,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:07:48,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:07:48,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:07:48,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:07:48,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:07:48,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:07:48,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:07:48,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:07:48,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:07:48,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:07:48,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:07:48,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:07:48,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:07:48,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:07:48,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:07:48,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:07:48,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:07:48,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:07:48,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:07:48,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:07:48,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:07:48,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:07:48,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:07:48,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:07:48,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:07:48,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:07:48,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:07:48,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:07:48,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:07:48,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:07:48,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:07:48,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:07:48,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:07:48,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:07:48,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:07:48,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:07:48,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:07:48,959 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 22:07:48,982 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:07:48,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:07:48,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:07:48,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:07:48,985 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:07:48,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:07:48,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:07:48,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:07:48,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:07:48,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:07:48,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:07:48,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:07:48,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:07:48,988 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:07:48,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:07:48,988 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:07:48,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:07:48,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:07:48,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:07:48,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:07:48,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:07:48,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:48,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:07:48,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:07:48,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:07:48,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:07:48,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:07:48,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:07:48,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:07:49,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:07:49,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:07:49,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:07:49,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:07:49,278 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:07:49,279 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/min_max.i [2019-10-14 22:07:49,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174a63f92/88986eea945d4feda012ff9cbb7a808b/FLAG90736f5fa [2019-10-14 22:07:49,832 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:07:49,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/min_max.i [2019-10-14 22:07:49,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174a63f92/88986eea945d4feda012ff9cbb7a808b/FLAG90736f5fa [2019-10-14 22:07:50,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174a63f92/88986eea945d4feda012ff9cbb7a808b [2019-10-14 22:07:50,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:07:50,141 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:07:50,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:50,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:07:50,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:07:50,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:50" (1/1) ... [2019-10-14 22:07:50,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4fe340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:50, skipping insertion in model container [2019-10-14 22:07:50,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:50" (1/1) ... [2019-10-14 22:07:50,158 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:07:50,199 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:07:50,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:50,733 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:07:50,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:50,876 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:07:50,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:50 WrapperNode [2019-10-14 22:07:50,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:50,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:07:50,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:07:50,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:07:50,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:50" (1/1) ... [2019-10-14 22:07:50,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:50" (1/1) ... [2019-10-14 22:07:50,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:50" (1/1) ... [2019-10-14 22:07:50,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:50" (1/1) ... [2019-10-14 22:07:50,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:50" (1/1) ... [2019-10-14 22:07:50,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:50" (1/1) ... [2019-10-14 22:07:50,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:50" (1/1) ... [2019-10-14 22:07:50,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:07:50,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:07:50,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:07:50,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:07:50,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:07:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:07:51,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 22:07:51,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 22:07:51,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 22:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 22:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:07:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:07:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:07:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:07:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:07:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:07:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:07:51,059 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:07:51,059 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:07:51,059 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:07:51,059 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:07:51,059 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:07:51,059 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:07:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:07:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:07:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:07:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:07:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:07:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:07:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:07:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:07:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:07:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:07:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:07:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:07:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:07:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:07:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:07:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:07:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:07:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:07:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:07:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:07:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:07:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:07:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:07:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:07:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:07:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:07:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:07:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:07:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:07:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:07:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:07:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:07:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:07:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:07:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:07:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:07:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:07:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:07:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:07:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:07:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:07:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:07:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:07:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:07:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:07:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:07:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:07:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:07:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:07:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:07:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:07:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:07:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:07:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:07:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:07:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:07:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:07:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:07:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:07:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:07:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:07:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:07:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:07:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:07:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:07:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:07:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:07:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:07:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:07:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:07:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:07:51,569 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:07:51,569 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 22:07:51,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:51 BoogieIcfgContainer [2019-10-14 22:07:51,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:07:51,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:07:51,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:07:51,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:07:51,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:07:50" (1/3) ... [2019-10-14 22:07:51,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26121af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:51, skipping insertion in model container [2019-10-14 22:07:51,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:50" (2/3) ... [2019-10-14 22:07:51,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26121af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:51, skipping insertion in model container [2019-10-14 22:07:51,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:51" (3/3) ... [2019-10-14 22:07:51,582 INFO L109 eAbstractionObserver]: Analyzing ICFG min_max.i [2019-10-14 22:07:51,593 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:07:51,601 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-14 22:07:51,613 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-14 22:07:51,638 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:07:51,639 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:07:51,639 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:07:51,639 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:07:51,640 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:07:51,640 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:07:51,641 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:07:51,641 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:07:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-14 22:07:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-14 22:07:51,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:51,668 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:51,670 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:51,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1192142104, now seen corresponding path program 1 times [2019-10-14 22:07:51,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:51,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359906479] [2019-10-14 22:07:51,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:51,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:51,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:51,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359906479] [2019-10-14 22:07:51,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:51,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:07:51,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364285840] [2019-10-14 22:07:51,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:07:51,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:51,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:07:51,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:07:51,876 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-10-14 22:07:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:51,991 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2019-10-14 22:07:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:07:51,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-14 22:07:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:52,004 INFO L225 Difference]: With dead ends: 53 [2019-10-14 22:07:52,004 INFO L226 Difference]: Without dead ends: 33 [2019-10-14 22:07:52,010 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-14 22:07:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-14 22:07:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-10-14 22:07:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-14 22:07:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-10-14 22:07:52,053 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2019-10-14 22:07:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:52,053 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-10-14 22:07:52,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:07:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-10-14 22:07:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-14 22:07:52,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:52,054 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:52,055 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:52,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1107899532, now seen corresponding path program 1 times [2019-10-14 22:07:52,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:52,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776540812] [2019-10-14 22:07:52,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:52,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:52,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:52,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776540812] [2019-10-14 22:07:52,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:52,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:07:52,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665349992] [2019-10-14 22:07:52,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:07:52,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:52,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:07:52,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:07:52,189 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-10-14 22:07:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:52,330 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-14 22:07:52,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:07:52,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-14 22:07:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:52,332 INFO L225 Difference]: With dead ends: 34 [2019-10-14 22:07:52,332 INFO L226 Difference]: Without dead ends: 23 [2019-10-14 22:07:52,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:52,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-14 22:07:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-14 22:07:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 22:07:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-14 22:07:52,340 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 12 [2019-10-14 22:07:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:52,340 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-14 22:07:52,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:07:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-10-14 22:07:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 22:07:52,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:52,341 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:52,342 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:52,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash 897845277, now seen corresponding path program 1 times [2019-10-14 22:07:52,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:52,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790998568] [2019-10-14 22:07:52,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:52,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:52,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:52,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790998568] [2019-10-14 22:07:52,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:52,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 22:07:52,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429086007] [2019-10-14 22:07:52,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:07:52,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:52,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:07:52,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:07:52,583 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 8 states. [2019-10-14 22:07:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:52,783 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-10-14 22:07:52,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:52,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-14 22:07:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:52,785 INFO L225 Difference]: With dead ends: 32 [2019-10-14 22:07:52,785 INFO L226 Difference]: Without dead ends: 30 [2019-10-14 22:07:52,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:07:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-14 22:07:52,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-10-14 22:07:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-14 22:07:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-14 22:07:52,792 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2019-10-14 22:07:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:52,792 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-14 22:07:52,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:07:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-14 22:07:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 22:07:52,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:52,793 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:52,794 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:52,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:52,794 INFO L82 PathProgramCache]: Analyzing trace with hash -458989665, now seen corresponding path program 1 times [2019-10-14 22:07:52,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:52,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780261779] [2019-10-14 22:07:52,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:52,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:52,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:52,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780261779] [2019-10-14 22:07:52,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:52,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 22:07:52,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11199395] [2019-10-14 22:07:53,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:07:53,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:53,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:07:53,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:07:53,002 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 9 states. [2019-10-14 22:07:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:53,249 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-10-14 22:07:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:07:53,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-10-14 22:07:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:53,251 INFO L225 Difference]: With dead ends: 44 [2019-10-14 22:07:53,251 INFO L226 Difference]: Without dead ends: 42 [2019-10-14 22:07:53,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-14 22:07:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-14 22:07:53,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-10-14 22:07:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 22:07:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-14 22:07:53,259 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-14 22:07:53,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:53,259 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-14 22:07:53,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:07:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-14 22:07:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 22:07:53,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:53,260 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:53,260 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:53,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:53,261 INFO L82 PathProgramCache]: Analyzing trace with hash 221068705, now seen corresponding path program 1 times [2019-10-14 22:07:53,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:53,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428612817] [2019-10-14 22:07:53,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:53,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:53,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:53,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428612817] [2019-10-14 22:07:53,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:53,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 22:07:53,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995606197] [2019-10-14 22:07:53,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 22:07:53,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:53,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 22:07:53,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:07:53,549 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 10 states. [2019-10-14 22:07:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:53,796 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-14 22:07:53,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:07:53,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-10-14 22:07:53,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:53,798 INFO L225 Difference]: With dead ends: 37 [2019-10-14 22:07:53,798 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 22:07:53,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:07:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 22:07:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-10-14 22:07:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 22:07:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-14 22:07:53,805 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-10-14 22:07:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:53,805 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-14 22:07:53,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 22:07:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-14 22:07:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 22:07:53,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:53,806 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:53,807 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:53,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1418643305, now seen corresponding path program 1 times [2019-10-14 22:07:53,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:53,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539532078] [2019-10-14 22:07:53,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:53,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:53,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:53,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539532078] [2019-10-14 22:07:53,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220032115] [2019-10-14 22:07:53,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:54,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-14 22:07:54,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:54,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:54,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:54,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-10-14 22:07:54,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:54,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:54,204 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,209 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-10-14 22:07:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:54,215 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:54,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-10-14 22:07:54,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65604086] [2019-10-14 22:07:54,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:07:54,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:54,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:07:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:07:54,217 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 8 states. [2019-10-14 22:07:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:54,382 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-10-14 22:07:54,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:54,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-10-14 22:07:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:54,387 INFO L225 Difference]: With dead ends: 48 [2019-10-14 22:07:54,388 INFO L226 Difference]: Without dead ends: 32 [2019-10-14 22:07:54,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-14 22:07:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-14 22:07:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-14 22:07:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 22:07:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-10-14 22:07:54,399 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2019-10-14 22:07:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:54,399 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-14 22:07:54,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:07:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-10-14 22:07:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 22:07:54,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:54,402 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] [2019-10-14 22:07:54,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:54,614 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:54,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1939400262, now seen corresponding path program 2 times [2019-10-14 22:07:54,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:54,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689913967] [2019-10-14 22:07:54,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:54,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:54,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:07:54,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689913967] [2019-10-14 22:07:54,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707341223] [2019-10-14 22:07:54,753 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:54,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:54,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:54,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 22:07:54,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:54,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-14 22:07:54,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-14 22:07:54,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-10-14 22:07:54,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-10-14 22:07:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:07:54,921 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:54,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-10-14 22:07:54,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141986579] [2019-10-14 22:07:54,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 22:07:54,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:54,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 22:07:54,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:07:54,923 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 10 states. [2019-10-14 22:07:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:55,187 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-10-14 22:07:55,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:07:55,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-14 22:07:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:55,189 INFO L225 Difference]: With dead ends: 90 [2019-10-14 22:07:55,189 INFO L226 Difference]: Without dead ends: 71 [2019-10-14 22:07:55,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-10-14 22:07:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-14 22:07:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-10-14 22:07:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 22:07:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-10-14 22:07:55,198 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2019-10-14 22:07:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:55,198 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-10-14 22:07:55,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 22:07:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-10-14 22:07:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 22:07:55,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:55,200 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:55,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:55,413 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1681234824, now seen corresponding path program 1 times [2019-10-14 22:07:55,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:55,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752485360] [2019-10-14 22:07:55,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:55,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:55,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:55,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752485360] [2019-10-14 22:07:55,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074936742] [2019-10-14 22:07:55,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:55,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-14 22:07:55,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:55,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:55,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:55,842 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:55,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,870 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_9|, |v_#memory_$Pointer$.base_9|], 4=[|v_#memory_int_11|]} [2019-10-14 22:07:55,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:55,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:55,915 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:55,983 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 28 treesize of output 20 [2019-10-14 22:07:55,984 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,004 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:42 [2019-10-14 22:07:56,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-10-14 22:07:56,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:56,156 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:56,164 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2019-10-14 22:07:56,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2019-10-14 22:07:56,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-10-14 22:07:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:56,228 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:56,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-10-14 22:07:56,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905532396] [2019-10-14 22:07:56,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 22:07:56,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 22:07:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:07:56,230 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 17 states. [2019-10-14 22:07:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:56,883 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-10-14 22:07:56,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:07:56,884 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-10-14 22:07:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:56,885 INFO L225 Difference]: With dead ends: 71 [2019-10-14 22:07:56,886 INFO L226 Difference]: Without dead ends: 69 [2019-10-14 22:07:56,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-10-14 22:07:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-14 22:07:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2019-10-14 22:07:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-14 22:07:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-10-14 22:07:56,896 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 27 [2019-10-14 22:07:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:56,896 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-10-14 22:07:56,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 22:07:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-10-14 22:07:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 22:07:56,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:56,898 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:57,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:57,102 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:57,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1344449784, now seen corresponding path program 1 times [2019-10-14 22:07:57,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:57,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911663567] [2019-10-14 22:07:57,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:57,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:57,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:57,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911663567] [2019-10-14 22:07:57,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305627316] [2019-10-14 22:07:57,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-14 22:07:57,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:57,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:57,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:57,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:57,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,552 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_10|, |v_#memory_$Pointer$.base_10|], 4=[|v_#memory_int_12|]} [2019-10-14 22:07:57,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:57,559 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:57,583 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:57,602 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 28 treesize of output 20 [2019-10-14 22:07:57,603 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,614 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-10-14 22:07:57,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:57,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:57,683 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-10-14 22:07:57,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:57,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,718 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-14 22:07:57,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 22:07:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:57,724 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:57,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2019-10-14 22:07:57,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54721210] [2019-10-14 22:07:57,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 22:07:57,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:57,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 22:07:57,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:07:57,726 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 15 states. [2019-10-14 22:07:58,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:58,415 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-10-14 22:07:58,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 22:07:58,416 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-10-14 22:07:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:58,417 INFO L225 Difference]: With dead ends: 65 [2019-10-14 22:07:58,417 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 22:07:58,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:07:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 22:07:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-10-14 22:07:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 22:07:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-10-14 22:07:58,426 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2019-10-14 22:07:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:58,427 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-10-14 22:07:58,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 22:07:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-10-14 22:07:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:07:58,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:58,428 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:58,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:58,632 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:58,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:58,633 INFO L82 PathProgramCache]: Analyzing trace with hash -758836934, now seen corresponding path program 1 times [2019-10-14 22:07:58,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:58,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885796104] [2019-10-14 22:07:58,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:58,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:58,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:58,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885796104] [2019-10-14 22:07:58,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034938302] [2019-10-14 22:07:58,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-14 22:07:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:58,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-14 22:07:58,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:58,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:58,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:59,014 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:59,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,035 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_11|, |v_#memory_$Pointer$.base_11|], 4=[|v_#memory_int_13|]} [2019-10-14 22:07:59,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:59,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:59,059 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:59,081 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 28 treesize of output 20 [2019-10-14 22:07:59,081 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,093 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-10-14 22:07:59,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:59,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:59,161 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-10-14 22:07:59,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:59,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,199 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-14 22:07:59,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 22:07:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:59,205 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:59,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-10-14 22:07:59,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531881771] [2019-10-14 22:07:59,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 22:07:59,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:59,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 22:07:59,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:07:59,206 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 15 states. [2019-10-14 22:08:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:00,056 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2019-10-14 22:08:00,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 22:08:00,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-10-14 22:08:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:00,058 INFO L225 Difference]: With dead ends: 92 [2019-10-14 22:08:00,058 INFO L226 Difference]: Without dead ends: 90 [2019-10-14 22:08:00,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-10-14 22:08:00,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-14 22:08:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2019-10-14 22:08:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 22:08:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-10-14 22:08:00,067 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 29 [2019-10-14 22:08:00,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:00,067 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-10-14 22:08:00,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 22:08:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-10-14 22:08:00,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:08:00,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:00,072 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:00,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:00,273 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:00,274 INFO L82 PathProgramCache]: Analyzing trace with hash -768788038, now seen corresponding path program 1 times [2019-10-14 22:08:00,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:00,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191367305] [2019-10-14 22:08:00,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:00,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:00,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:00,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191367305] [2019-10-14 22:08:00,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278275276] [2019-10-14 22:08:00,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:00,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-14 22:08:00,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:00,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:00,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:00,745 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:08:00,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,767 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_12|, |v_#memory_$Pointer$.offset_12|], 4=[|v_#memory_int_14|]} [2019-10-14 22:08:00,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:00,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:00,796 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:00,828 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 28 treesize of output 20 [2019-10-14 22:08:00,829 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,844 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:33 [2019-10-14 22:08:00,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-10-14 22:08:00,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:08:01,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:01,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2019-10-14 22:08:01,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2019-10-14 22:08:01,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-10-14 22:08:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:01,084 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:01,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2019-10-14 22:08:01,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172364533] [2019-10-14 22:08:01,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 22:08:01,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:01,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 22:08:01,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:08:01,085 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 19 states. [2019-10-14 22:08:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:02,095 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2019-10-14 22:08:02,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 22:08:02,096 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-10-14 22:08:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:02,098 INFO L225 Difference]: With dead ends: 113 [2019-10-14 22:08:02,098 INFO L226 Difference]: Without dead ends: 111 [2019-10-14 22:08:02,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-10-14 22:08:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-14 22:08:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2019-10-14 22:08:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-14 22:08:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-10-14 22:08:02,108 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2019-10-14 22:08:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:02,109 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-10-14 22:08:02,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 22:08:02,109 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-10-14 22:08:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:08:02,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:02,110 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:02,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:02,315 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:02,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1436663426, now seen corresponding path program 2 times [2019-10-14 22:08:02,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:02,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428581507] [2019-10-14 22:08:02,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:02,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:02,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 22:08:02,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428581507] [2019-10-14 22:08:02,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222408737] [2019-10-14 22:08:02,431 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:02,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:08:02,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:02,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 22:08:02,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:02,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-14 22:08:02,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-14 22:08:02,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-10-14 22:08:02,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-10-14 22:08:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 22:08:02,640 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:02,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-10-14 22:08:02,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503065784] [2019-10-14 22:08:02,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 22:08:02,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:02,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 22:08:02,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-14 22:08:02,643 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 11 states. [2019-10-14 22:08:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:02,896 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2019-10-14 22:08:02,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 22:08:02,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-10-14 22:08:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:02,900 INFO L225 Difference]: With dead ends: 145 [2019-10-14 22:08:02,900 INFO L226 Difference]: Without dead ends: 100 [2019-10-14 22:08:02,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-10-14 22:08:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-14 22:08:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 60. [2019-10-14 22:08:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-14 22:08:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-10-14 22:08:02,911 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 29 [2019-10-14 22:08:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:02,911 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-10-14 22:08:02,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 22:08:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-10-14 22:08:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:08:02,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:02,912 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:03,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:03,122 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:03,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:03,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1847186620, now seen corresponding path program 1 times [2019-10-14 22:08:03,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:03,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452206825] [2019-10-14 22:08:03,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:03,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:03,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:03,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452206825] [2019-10-14 22:08:03,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581928530] [2019-10-14 22:08:03,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:03,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-14 22:08:03,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:03,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:03,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:03,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:08:03,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,498 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_13|, |v_#memory_$Pointer$.offset_13|], 4=[|v_#memory_int_15|]} [2019-10-14 22:08:03,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:03,504 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:03,525 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:03,545 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 28 treesize of output 20 [2019-10-14 22:08:03,545 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,561 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-10-14 22:08:03,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:08:03,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:08:03,634 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,641 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-10-14 22:08:03,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:08:03,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,667 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-14 22:08:03,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 22:08:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:03,676 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:03,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2019-10-14 22:08:03,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852637522] [2019-10-14 22:08:03,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 22:08:03,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:03,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 22:08:03,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-14 22:08:03,679 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 16 states. [2019-10-14 22:08:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:04,875 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2019-10-14 22:08:04,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 22:08:04,875 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-10-14 22:08:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:04,876 INFO L225 Difference]: With dead ends: 92 [2019-10-14 22:08:04,876 INFO L226 Difference]: Without dead ends: 90 [2019-10-14 22:08:04,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2019-10-14 22:08:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-14 22:08:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2019-10-14 22:08:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-14 22:08:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2019-10-14 22:08:04,884 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 29 [2019-10-14 22:08:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:04,885 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2019-10-14 22:08:04,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 22:08:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-10-14 22:08:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:08:04,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:04,886 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-14 22:08:05,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:05,091 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:05,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1837235516, now seen corresponding path program 1 times [2019-10-14 22:08:05,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:05,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466048181] [2019-10-14 22:08:05,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:05,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:05,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:05,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466048181] [2019-10-14 22:08:05,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251613661] [2019-10-14 22:08:05,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:05,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-14 22:08:05,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:05,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:05,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:05,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:08:05,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,756 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_14|, |v_#memory_$Pointer$.offset_14|], 4=[|v_#memory_int_16|]} [2019-10-14 22:08:05,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:05,763 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:05,788 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:05,820 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 28 treesize of output 20 [2019-10-14 22:08:05,821 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,842 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:42 [2019-10-14 22:08:06,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2019-10-14 22:08:06,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:08:06,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:06,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:30 [2019-10-14 22:08:06,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-10-14 22:08:06,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-10-14 22:08:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:06,117 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:06,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2019-10-14 22:08:06,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987066997] [2019-10-14 22:08:06,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 22:08:06,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:06,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 22:08:06,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-10-14 22:08:06,118 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 22 states. [2019-10-14 22:08:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:08,658 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2019-10-14 22:08:08,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-14 22:08:08,660 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-10-14 22:08:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:08,661 INFO L225 Difference]: With dead ends: 135 [2019-10-14 22:08:08,661 INFO L226 Difference]: Without dead ends: 133 [2019-10-14 22:08:08,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=329, Invalid=1927, Unknown=0, NotChecked=0, Total=2256 [2019-10-14 22:08:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-14 22:08:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 39. [2019-10-14 22:08:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 22:08:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-10-14 22:08:08,668 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 29 [2019-10-14 22:08:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:08,668 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-10-14 22:08:08,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 22:08:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-10-14 22:08:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:08:08,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:08,669 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:08,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:08,875 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:08,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2094339090, now seen corresponding path program 2 times [2019-10-14 22:08:08,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:08,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315349161] [2019-10-14 22:08:08,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:08,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:08,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:09,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315349161] [2019-10-14 22:08:09,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801373529] [2019-10-14 22:08:09,037 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:09,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:08:09,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:09,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-14 22:08:09,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:09,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:09,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:09,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:09,201 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,208 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2019-10-14 22:08:09,223 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:08:09,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,256 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 27 treesize of output 11 [2019-10-14 22:08:09,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:08:09,281 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,304 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 27 treesize of output 11 [2019-10-14 22:08:09,304 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:08:09,320 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,329 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:39 [2019-10-14 22:08:09,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,428 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 69 treesize of output 52 [2019-10-14 22:08:09,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,433 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-14 22:08:09,448 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-10-14 22:08:09,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-10-14 22:08:09,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,468 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-10-14 22:08:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:09,472 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:09,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-10-14 22:08:09,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921006346] [2019-10-14 22:08:09,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 22:08:09,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:09,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 22:08:09,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-14 22:08:09,473 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 14 states. [2019-10-14 22:08:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:09,949 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-10-14 22:08:09,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:08:09,950 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-10-14 22:08:09,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:09,951 INFO L225 Difference]: With dead ends: 67 [2019-10-14 22:08:09,951 INFO L226 Difference]: Without dead ends: 46 [2019-10-14 22:08:09,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:08:09,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-14 22:08:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-14 22:08:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 22:08:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-10-14 22:08:09,962 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 32 [2019-10-14 22:08:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:09,962 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-10-14 22:08:09,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 22:08:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-10-14 22:08:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 22:08:09,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:09,963 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:10,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:10,167 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:10,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:10,168 INFO L82 PathProgramCache]: Analyzing trace with hash 934068797, now seen corresponding path program 3 times [2019-10-14 22:08:10,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:10,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339491474] [2019-10-14 22:08:10,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:10,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:10,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:10,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339491474] [2019-10-14 22:08:10,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402244179] [2019-10-14 22:08:10,574 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:10,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 22:08:10,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:10,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-14 22:08:10,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:10,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:10,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:10,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:10,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:10,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,799 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-14 22:08:10,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:10,850 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-10-14 22:08:10,851 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_18|], 4=[|v_#memory_int_17|]} [2019-10-14 22:08:10,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:10,857 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:10,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:10,882 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:10,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:10,910 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 28 treesize of output 20 [2019-10-14 22:08:10,910 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:10,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:10,926 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-10-14 22:08:10,992 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,992 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-14 22:08:10,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,052 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_19|, |v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|], 4=[|v_#memory_int_18|]} [2019-10-14 22:08:11,058 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-14 22:08:11,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,106 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-14 22:08:11,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:11,150 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 44 treesize of output 39 [2019-10-14 22:08:11,151 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,216 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-10-14 22:08:11,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:11,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:11,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-10-14 22:08:11,249 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:11,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-10-14 22:08:11,284 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,331 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:135, output treesize:71 [2019-10-14 22:08:11,654 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-14 22:08:11,654 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 55 [2019-10-14 22:08:11,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:11,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:11,657 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-14 22:08:11,695 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.3 percent of original size [2019-10-14 22:08:11,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-10-14 22:08:11,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:11,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:26 [2019-10-14 22:08:11,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-14 22:08:11,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:11,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-14 22:08:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:11,809 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:11,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2019-10-14 22:08:11,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705916693] [2019-10-14 22:08:11,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-14 22:08:11,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-14 22:08:11,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2019-10-14 22:08:11,811 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 27 states. [2019-10-14 22:08:13,474 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-10-14 22:08:14,247 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-10-14 22:08:14,436 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-10-14 22:08:14,652 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-10-14 22:08:14,979 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-10-14 22:08:15,184 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-10-14 22:08:15,426 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-10-14 22:08:15,824 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-10-14 22:08:16,583 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-10-14 22:08:17,132 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-10-14 22:08:17,452 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-10-14 22:08:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:17,881 INFO L93 Difference]: Finished difference Result 279 states and 305 transitions. [2019-10-14 22:08:17,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-14 22:08:17,881 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-10-14 22:08:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:17,883 INFO L225 Difference]: With dead ends: 279 [2019-10-14 22:08:17,883 INFO L226 Difference]: Without dead ends: 277 [2019-10-14 22:08:17,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=568, Invalid=3464, Unknown=0, NotChecked=0, Total=4032 [2019-10-14 22:08:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-14 22:08:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 93. [2019-10-14 22:08:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-14 22:08:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2019-10-14 22:08:17,901 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 37 [2019-10-14 22:08:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:17,902 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2019-10-14 22:08:17,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-14 22:08:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2019-10-14 22:08:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 22:08:17,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:17,904 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:18,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:18,108 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:18,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash 833472957, now seen corresponding path program 1 times [2019-10-14 22:08:18,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:18,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358768842] [2019-10-14 22:08:18,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:18,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:18,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:18,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358768842] [2019-10-14 22:08:18,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990015630] [2019-10-14 22:08:18,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:18,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-14 22:08:18,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:18,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:18,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:18,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:18,652 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:18,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:08:18,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:18,687 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|], 4=[|v_#memory_int_19|]} [2019-10-14 22:08:18,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:18,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:18,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:18,727 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:18,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,764 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 35 treesize of output 23 [2019-10-14 22:08:18,765 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:18,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,789 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:85, output treesize:56 [2019-10-14 22:08:18,891 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_22|], 9=[|v_#memory_int_20|]} [2019-10-14 22:08:18,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,905 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 48 treesize of output 28 [2019-10-14 22:08:18,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:18,954 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-14 22:08:18,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:19,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:19,013 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:19,013 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 1 case distinctions, treesize of input 24 treesize of output 43 [2019-10-14 22:08:19,014 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:19,095 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.1 percent of original size [2019-10-14 22:08:19,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:19,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 51 [2019-10-14 22:08:19,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,116 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:19,204 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.1 percent of original size [2019-10-14 22:08:19,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:19,213 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:19,242 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:19,243 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 3 case distinctions, treesize of input 48 treesize of output 75 [2019-10-14 22:08:19,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,248 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:19,376 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-10-14 22:08:19,376 INFO L567 ElimStorePlain]: treesize reduction 34, result has 79.6 percent of original size [2019-10-14 22:08:19,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:19,381 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:132, output treesize:143 [2019-10-14 22:08:19,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:19,764 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-10-14 22:08:19,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:19,962 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-10-14 22:08:20,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:20,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:20,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,250 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 75 treesize of output 62 [2019-10-14 22:08:20,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:20,258 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:20,263 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,263 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 63 [2019-10-14 22:08:20,265 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-14 22:08:20,284 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-14 22:08:20,285 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 76 [2019-10-14 22:08:20,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:20,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:20,288 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-14 22:08:20,380 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.7 percent of original size [2019-10-14 22:08:20,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:20,396 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2019-10-14 22:08:20,397 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:20,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:20,415 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2019-10-14 22:08:20,416 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:20,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,424 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 44 treesize of output 43 [2019-10-14 22:08:20,425 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:20,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-10-14 22:08:20,455 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:270, output treesize:88 [2019-10-14 22:08:20,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:20,566 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_4, |#memory_int|], 3=[v_prenex_6]} [2019-10-14 22:08:20,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,575 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2019-10-14 22:08:20,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:20,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:20,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,608 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,609 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 [2019-10-14 22:08:20,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:20,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:20,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,651 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,652 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 41 [2019-10-14 22:08:20,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:20,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:20,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:20,656 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:20,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:20,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:08:20,679 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:100, output treesize:11 [2019-10-14 22:08:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:20,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:20,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2019-10-14 22:08:20,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841824680] [2019-10-14 22:08:20,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-14 22:08:20,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:20,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-14 22:08:20,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-14 22:08:20,730 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand 26 states. [2019-10-14 22:08:22,159 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2019-10-14 22:08:22,407 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-10-14 22:08:22,664 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-10-14 22:08:23,121 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2019-10-14 22:08:23,558 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2019-10-14 22:08:24,680 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 125 [2019-10-14 22:08:25,326 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-10-14 22:08:25,688 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 153 [2019-10-14 22:08:26,716 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-10-14 22:08:27,079 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 155 [2019-10-14 22:08:27,793 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-10-14 22:08:28,083 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 99 [2019-10-14 22:08:28,318 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-10-14 22:08:28,865 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-10-14 22:08:29,146 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 101 [2019-10-14 22:08:29,972 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-10-14 22:08:30,164 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-10-14 22:08:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:30,526 INFO L93 Difference]: Finished difference Result 453 states and 500 transitions. [2019-10-14 22:08:30,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-14 22:08:30,527 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2019-10-14 22:08:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:30,530 INFO L225 Difference]: With dead ends: 453 [2019-10-14 22:08:30,530 INFO L226 Difference]: Without dead ends: 451 [2019-10-14 22:08:30,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1966 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1165, Invalid=6317, Unknown=0, NotChecked=0, Total=7482 [2019-10-14 22:08:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-10-14 22:08:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 120. [2019-10-14 22:08:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-14 22:08:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2019-10-14 22:08:30,548 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 37 [2019-10-14 22:08:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:30,549 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2019-10-14 22:08:30,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-14 22:08:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2019-10-14 22:08:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 22:08:30,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:30,550 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:30,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:30,751 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:30,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:30,752 INFO L82 PathProgramCache]: Analyzing trace with hash 581200573, now seen corresponding path program 2 times [2019-10-14 22:08:30,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:30,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059453006] [2019-10-14 22:08:30,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:30,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:30,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:31,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059453006] [2019-10-14 22:08:31,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332882112] [2019-10-14 22:08:31,083 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:31,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:08:31,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:31,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-14 22:08:31,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:31,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:31,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:31,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,264 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-14 22:08:31,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,308 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-10-14 22:08:31,314 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|], 4=[|v_#memory_int_21|]} [2019-10-14 22:08:31,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:31,318 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:08:31,349 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:31,374 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 28 treesize of output 20 [2019-10-14 22:08:31,374 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,389 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:41 [2019-10-14 22:08:31,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,449 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-14 22:08:31,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,508 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.offset_25|], 4=[|v_#memory_int_22|]} [2019-10-14 22:08:31,518 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 47 treesize of output 23 [2019-10-14 22:08:31,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,568 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 39 treesize of output 30 [2019-10-14 22:08:31,569 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,626 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 27 treesize of output 11 [2019-10-14 22:08:31,626 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,667 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 19 treesize of output 18 [2019-10-14 22:08:31,668 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:31,706 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 32 treesize of output 24 [2019-10-14 22:08:31,707 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,742 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:144, output treesize:97 [2019-10-14 22:08:32,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 66 [2019-10-14 22:08:32,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:32,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:32,090 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-14 22:08:32,121 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.1 percent of original size [2019-10-14 22:08:32,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-10-14 22:08:32,125 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:32,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:24 [2019-10-14 22:08:32,193 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,193 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2019-10-14 22:08:32,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:32,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-10-14 22:08:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:32,253 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:32,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2019-10-14 22:08:32,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774088734] [2019-10-14 22:08:32,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-14 22:08:32,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:32,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-14 22:08:32,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-10-14 22:08:32,255 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand 23 states. [2019-10-14 22:08:33,078 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-10-14 22:08:33,239 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2019-10-14 22:08:33,420 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70