java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:38:06,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:38:06,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:38:06,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:38:06,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:38:06,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:38:06,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:38:06,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:38:06,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:38:06,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:38:06,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:38:06,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:38:06,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:38:06,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:38:06,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:38:06,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:38:06,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:38:06,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:38:06,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:38:06,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:38:06,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:38:06,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:38:06,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:38:06,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:38:06,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:38:06,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:38:06,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:38:06,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:38:06,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:38:06,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:38:06,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:38:06,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:38:06,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:38:06,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:38:06,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:38:06,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:38:06,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:38:06,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:38:06,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:38:06,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:38:06,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:38:06,817 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-09-08 01:38:06,857 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:38:06,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:38:06,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:38:06,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:38:06,859 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:38:06,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:38:06,859 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:38:06,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:38:06,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:38:06,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:38:06,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:38:06,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:38:06,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:38:06,861 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:38:06,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:38:06,861 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:38:06,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:38:06,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:38:06,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:38:06,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:38:06,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:38:06,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:38:06,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:38:06,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:38:06,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:38:06,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:38:06,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:38:06,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:38:06,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:38:06,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:38:06,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:38:06,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:38:06,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:38:06,948 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:38:06,949 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-09-08 01:38:07,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2fc38a4/6c6178cbd0984737993a565ffbf0544a/FLAGa619a6120 [2019-09-08 01:38:07,600 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:38:07,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-09-08 01:38:07,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2fc38a4/6c6178cbd0984737993a565ffbf0544a/FLAGa619a6120 [2019-09-08 01:38:07,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2fc38a4/6c6178cbd0984737993a565ffbf0544a [2019-09-08 01:38:07,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:38:07,898 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:38:07,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:38:07,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:38:07,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:38:07,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:38:07" (1/1) ... [2019-09-08 01:38:07,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18230a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:07, skipping insertion in model container [2019-09-08 01:38:07,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:38:07" (1/1) ... [2019-09-08 01:38:07,917 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:38:07,986 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:38:08,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:38:08,512 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:38:08,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:38:08,636 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:38:08,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:08 WrapperNode [2019-09-08 01:38:08,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:38:08,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:38:08,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:38:08,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:38:08,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:08" (1/1) ... [2019-09-08 01:38:08,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:08" (1/1) ... [2019-09-08 01:38:08,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:08" (1/1) ... [2019-09-08 01:38:08,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:08" (1/1) ... [2019-09-08 01:38:08,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:08" (1/1) ... [2019-09-08 01:38:08,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:08" (1/1) ... [2019-09-08 01:38:08,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:08" (1/1) ... [2019-09-08 01:38:08,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:38:08,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:38:08,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:38:08,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:38:08,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:08" (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-09-08 01:38:08,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:38:08,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:38:08,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:38:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 01:38:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 01:38:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 01:38:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 01:38:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 01:38:08,799 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 01:38:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 01:38:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 01:38:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 01:38:08,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 01:38:08,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 01:38:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 01:38:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 01:38:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 01:38:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 01:38:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 01:38:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 01:38:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 01:38:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 01:38:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 01:38:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 01:38:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 01:38:08,808 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 01:38:08,808 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 01:38:08,808 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 01:38:08,808 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 01:38:08,808 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 01:38:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 01:38:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 01:38:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 01:38:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 01:38:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 01:38:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 01:38:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 01:38:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 01:38:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 01:38:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 01:38:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 01:38:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 01:38:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 01:38:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 01:38:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 01:38:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 01:38:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 01:38:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 01:38:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 01:38:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 01:38:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 01:38:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 01:38:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 01:38:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 01:38:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 01:38:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 01:38:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 01:38:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 01:38:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 01:38:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 01:38:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 01:38:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 01:38:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 01:38:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 01:38:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 01:38:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 01:38:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 01:38:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 01:38:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 01:38:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 01:38:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 01:38:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 01:38:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 01:38:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 01:38:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 01:38:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 01:38:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 01:38:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 01:38:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 01:38:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 01:38:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 01:38:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 01:38:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 01:38:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 01:38:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 01:38:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 01:38:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 01:38:08,820 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 01:38:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 01:38:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 01:38:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 01:38:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 01:38:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 01:38:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 01:38:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 01:38:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 01:38:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 01:38:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 01:38:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 01:38:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 01:38:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 01:38:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 01:38:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 01:38:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 01:38:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 01:38:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 01:38:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:38:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:38:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:38:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 01:38:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 01:38:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 01:38:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:38:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:38:08,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:38:09,555 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:38:09,555 INFO L283 CfgBuilder]: Removed 30 assume(true) statements. [2019-09-08 01:38:09,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:38:09 BoogieIcfgContainer [2019-09-08 01:38:09,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:38:09,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:38:09,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:38:09,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:38:09,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:38:07" (1/3) ... [2019-09-08 01:38:09,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51eff659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:38:09, skipping insertion in model container [2019-09-08 01:38:09,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:08" (2/3) ... [2019-09-08 01:38:09,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51eff659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:38:09, skipping insertion in model container [2019-09-08 01:38:09,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:38:09" (3/3) ... [2019-09-08 01:38:09,566 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-09-08 01:38:09,577 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:38:09,587 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-09-08 01:38:09,605 INFO L252 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-09-08 01:38:09,635 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:38:09,636 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:38:09,637 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:38:09,637 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:38:09,637 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:38:09,637 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:38:09,637 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:38:09,638 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:38:09,638 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:38:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-09-08 01:38:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-09-08 01:38:09,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:09,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:09,671 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1861454184, now seen corresponding path program 1 times [2019-09-08 01:38:09,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:09,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:09,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:09,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:09,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:09,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:09,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:38:09,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:38:09,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:38:09,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:09,897 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-09-08 01:38:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:10,009 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2019-09-08 01:38:10,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:38:10,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-09-08 01:38:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:10,023 INFO L225 Difference]: With dead ends: 186 [2019-09-08 01:38:10,023 INFO L226 Difference]: Without dead ends: 99 [2019-09-08 01:38:10,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-08 01:38:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2019-09-08 01:38:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-08 01:38:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-09-08 01:38:10,072 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2019-09-08 01:38:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:10,073 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-09-08 01:38:10,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:38:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-09-08 01:38:10,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 01:38:10,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:10,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:10,074 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:10,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:10,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1461031906, now seen corresponding path program 1 times [2019-09-08 01:38:10,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:10,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:10,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:10,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:10,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:10,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:10,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:38:10,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:38:10,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:38:10,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:10,172 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 3 states. [2019-09-08 01:38:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:10,189 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-08 01:38:10,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:38:10,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-08 01:38:10,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:10,191 INFO L225 Difference]: With dead ends: 84 [2019-09-08 01:38:10,192 INFO L226 Difference]: Without dead ends: 82 [2019-09-08 01:38:10,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-08 01:38:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-09-08 01:38:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-08 01:38:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-09-08 01:38:10,207 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2019-09-08 01:38:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:10,207 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-09-08 01:38:10,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:38:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-09-08 01:38:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 01:38:10,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:10,208 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:10,210 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:10,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:10,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1461033828, now seen corresponding path program 1 times [2019-09-08 01:38:10,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:10,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:10,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:10,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:10,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:10,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:38:10,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:38:10,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:38:10,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:38:10,318 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 4 states. [2019-09-08 01:38:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:10,422 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-08 01:38:10,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:38:10,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-08 01:38:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:10,427 INFO L225 Difference]: With dead ends: 84 [2019-09-08 01:38:10,428 INFO L226 Difference]: Without dead ends: 82 [2019-09-08 01:38:10,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:38:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-08 01:38:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-09-08 01:38:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 01:38:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-09-08 01:38:10,440 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2019-09-08 01:38:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:10,441 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-09-08 01:38:10,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:38:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-09-08 01:38:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 01:38:10,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:10,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:10,442 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:10,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash 177734485, now seen corresponding path program 1 times [2019-09-08 01:38:10,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:10,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:10,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:10,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:10,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:10,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:10,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:38:10,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:38:10,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:38:10,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:38:10,557 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 4 states. [2019-09-08 01:38:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:10,705 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2019-09-08 01:38:10,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:38:10,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-09-08 01:38:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:10,707 INFO L225 Difference]: With dead ends: 199 [2019-09-08 01:38:10,707 INFO L226 Difference]: Without dead ends: 132 [2019-09-08 01:38:10,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:38:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-08 01:38:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2019-09-08 01:38:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-08 01:38:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-09-08 01:38:10,717 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 19 [2019-09-08 01:38:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:10,718 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-09-08 01:38:10,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:38:10,720 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-09-08 01:38:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 01:38:10,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:10,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:10,722 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash -631612141, now seen corresponding path program 1 times [2019-09-08 01:38:10,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:10,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:10,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:10,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:10,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:10,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 01:38:10,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:38:10,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:38:10,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:38:10,880 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 5 states. [2019-09-08 01:38:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:11,033 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2019-09-08 01:38:11,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:38:11,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-08 01:38:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:11,035 INFO L225 Difference]: With dead ends: 126 [2019-09-08 01:38:11,036 INFO L226 Difference]: Without dead ends: 122 [2019-09-08 01:38:11,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-09-08 01:38:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-08 01:38:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2019-09-08 01:38:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-08 01:38:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-09-08 01:38:11,056 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2019-09-08 01:38:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:11,056 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-09-08 01:38:11,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:38:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-09-08 01:38:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:38:11,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:11,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:11,059 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1894864309, now seen corresponding path program 1 times [2019-09-08 01:38:11,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:11,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:11,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:11,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:11,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 01:38:11,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:38:11,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:38:11,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:38:11,125 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2019-09-08 01:38:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:11,287 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2019-09-08 01:38:11,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:38:11,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-08 01:38:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:11,288 INFO L225 Difference]: With dead ends: 136 [2019-09-08 01:38:11,289 INFO L226 Difference]: Without dead ends: 116 [2019-09-08 01:38:11,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-09-08 01:38:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-08 01:38:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2019-09-08 01:38:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-08 01:38:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-09-08 01:38:11,297 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 20 [2019-09-08 01:38:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:11,298 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-09-08 01:38:11,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:38:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-09-08 01:38:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:38:11,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:11,299 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:11,302 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1337316768, now seen corresponding path program 1 times [2019-09-08 01:38:11,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:11,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:11,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:11,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:11,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:11,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:11,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:38:11,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:38:11,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:38:11,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:11,355 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 3 states. [2019-09-08 01:38:11,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:11,375 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2019-09-08 01:38:11,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:38:11,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-08 01:38:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:11,377 INFO L225 Difference]: With dead ends: 141 [2019-09-08 01:38:11,377 INFO L226 Difference]: Without dead ends: 100 [2019-09-08 01:38:11,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-08 01:38:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2019-09-08 01:38:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 01:38:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-09-08 01:38:11,387 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 24 [2019-09-08 01:38:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:11,387 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-09-08 01:38:11,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:38:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-09-08 01:38:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 01:38:11,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:11,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:11,392 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:11,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:11,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1492857654, now seen corresponding path program 1 times [2019-09-08 01:38:11,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:11,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:11,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:11,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:11,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:11,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:38:11,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:38:11,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:38:11,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:11,449 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 3 states. [2019-09-08 01:38:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:11,470 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2019-09-08 01:38:11,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:38:11,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-08 01:38:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:11,472 INFO L225 Difference]: With dead ends: 79 [2019-09-08 01:38:11,472 INFO L226 Difference]: Without dead ends: 77 [2019-09-08 01:38:11,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-08 01:38:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-09-08 01:38:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-08 01:38:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-09-08 01:38:11,483 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 25 [2019-09-08 01:38:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:11,485 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-09-08 01:38:11,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:38:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-09-08 01:38:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 01:38:11,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:11,490 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:11,491 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1632693981, now seen corresponding path program 1 times [2019-09-08 01:38:11,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:11,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:11,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:11,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:11,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:11,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:11,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:38:11,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:38:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:38:11,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:38:11,560 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2019-09-08 01:38:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:11,633 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2019-09-08 01:38:11,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:38:11,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-08 01:38:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:11,635 INFO L225 Difference]: With dead ends: 78 [2019-09-08 01:38:11,635 INFO L226 Difference]: Without dead ends: 76 [2019-09-08 01:38:11,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:38:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-08 01:38:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-08 01:38:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 01:38:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-09-08 01:38:11,641 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 27 [2019-09-08 01:38:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:11,642 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-09-08 01:38:11,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:38:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-09-08 01:38:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:38:11,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:11,643 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:11,644 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:11,644 INFO L82 PathProgramCache]: Analyzing trace with hash 668074133, now seen corresponding path program 1 times [2019-09-08 01:38:11,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:11,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:11,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:11,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:11,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:11,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:11,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 01:38:11,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:38:11,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:38:11,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:38:11,719 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 6 states. [2019-09-08 01:38:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:11,972 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2019-09-08 01:38:11,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:38:11,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-08 01:38:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:11,974 INFO L225 Difference]: With dead ends: 179 [2019-09-08 01:38:11,974 INFO L226 Difference]: Without dead ends: 137 [2019-09-08 01:38:11,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:38:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-08 01:38:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2019-09-08 01:38:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-08 01:38:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-09-08 01:38:11,985 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2019-09-08 01:38:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:11,986 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-09-08 01:38:11,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:38:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-09-08 01:38:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:38:11,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:11,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:11,987 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:11,988 INFO L82 PathProgramCache]: Analyzing trace with hash 567478293, now seen corresponding path program 1 times [2019-09-08 01:38:11,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:11,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:11,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:11,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:12,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:12,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 01:38:12,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:38:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:38:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:38:12,237 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 9 states. [2019-09-08 01:38:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:13,128 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2019-09-08 01:38:13,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:38:13,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-09-08 01:38:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:13,132 INFO L225 Difference]: With dead ends: 175 [2019-09-08 01:38:13,132 INFO L226 Difference]: Without dead ends: 173 [2019-09-08 01:38:13,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:38:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-08 01:38:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 104. [2019-09-08 01:38:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-08 01:38:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-09-08 01:38:13,142 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 28 [2019-09-08 01:38:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:13,142 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-09-08 01:38:13,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:38:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-09-08 01:38:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:38:13,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:13,144 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:13,144 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1429819819, now seen corresponding path program 1 times [2019-09-08 01:38:13,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:13,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:13,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:13,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:13,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 01:38:13,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:13,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 01:38:13,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:38:13,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:38:13,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:38:13,198 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 5 states. [2019-09-08 01:38:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:13,326 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2019-09-08 01:38:13,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:38:13,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-08 01:38:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:13,328 INFO L225 Difference]: With dead ends: 151 [2019-09-08 01:38:13,328 INFO L226 Difference]: Without dead ends: 133 [2019-09-08 01:38:13,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:38:13,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-08 01:38:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2019-09-08 01:38:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-08 01:38:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2019-09-08 01:38:13,337 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 30 [2019-09-08 01:38:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:13,337 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2019-09-08 01:38:13,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:38:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2019-09-08 01:38:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:38:13,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:13,339 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:13,339 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash -753501909, now seen corresponding path program 1 times [2019-09-08 01:38:13,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:13,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:13,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:13,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:13,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 01:38:13,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:13,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:38:13,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:38:13,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:38:13,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:13,366 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 3 states. [2019-09-08 01:38:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:13,412 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2019-09-08 01:38:13,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:38:13,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-08 01:38:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:13,414 INFO L225 Difference]: With dead ends: 125 [2019-09-08 01:38:13,414 INFO L226 Difference]: Without dead ends: 123 [2019-09-08 01:38:13,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-08 01:38:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-08 01:38:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-08 01:38:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-09-08 01:38:13,422 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 30 [2019-09-08 01:38:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:13,422 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-09-08 01:38:13,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:38:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-09-08 01:38:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 01:38:13,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:13,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:13,424 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:13,425 INFO L82 PathProgramCache]: Analyzing trace with hash 758661948, now seen corresponding path program 1 times [2019-09-08 01:38:13,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:13,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:13,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:13,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:13,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:13,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:13,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 01:38:13,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:38:13,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:38:13,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:38:13,666 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 9 states. [2019-09-08 01:38:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:14,464 INFO L93 Difference]: Finished difference Result 201 states and 229 transitions. [2019-09-08 01:38:14,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:38:14,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-08 01:38:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:14,466 INFO L225 Difference]: With dead ends: 201 [2019-09-08 01:38:14,466 INFO L226 Difference]: Without dead ends: 199 [2019-09-08 01:38:14,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:38:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-08 01:38:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 129. [2019-09-08 01:38:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-08 01:38:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-09-08 01:38:14,479 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2019-09-08 01:38:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:14,479 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-09-08 01:38:14,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:38:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-09-08 01:38:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-08 01:38:14,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:14,481 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:14,481 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:14,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:14,482 INFO L82 PathProgramCache]: Analyzing trace with hash -999338862, now seen corresponding path program 1 times [2019-09-08 01:38:14,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:14,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:14,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:14,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:14,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:14,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:38:14,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:38:14,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:38:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:14,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 01:38:14,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:38:14,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:14,717 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 16 treesize of output 17 [2019-09-08 01:38:14,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:14,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:14,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:14,742 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 16 treesize of output 17 [2019-09-08 01:38:14,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:14,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:14,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:14,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:36 [2019-09-08 01:38:14,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:14,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:14,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:14,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-09-08 01:38:14,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:14,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:14,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:14,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:14,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:14,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-09-08 01:38:14,824 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:14,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:14,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:14,841 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2019-09-08 01:38:14,923 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-09-08 01:38:14,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:14,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:14,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:14,943 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-09-08 01:38:14,944 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:14,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:14,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:14,949 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-09-08 01:38:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:14,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:38:14,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-09-08 01:38:14,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:38:14,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:38:14,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:38:14,971 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 8 states. [2019-09-08 01:38:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:15,358 INFO L93 Difference]: Finished difference Result 220 states and 252 transitions. [2019-09-08 01:38:15,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:38:15,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-09-08 01:38:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:15,360 INFO L225 Difference]: With dead ends: 220 [2019-09-08 01:38:15,360 INFO L226 Difference]: Without dead ends: 160 [2019-09-08 01:38:15,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:38:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-08 01:38:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2019-09-08 01:38:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-08 01:38:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2019-09-08 01:38:15,381 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 33 [2019-09-08 01:38:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:15,382 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2019-09-08 01:38:15,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:38:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2019-09-08 01:38:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-08 01:38:15,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:15,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:15,384 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:15,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2072098386, now seen corresponding path program 1 times [2019-09-08 01:38:15,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:15,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:15,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:15,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:15,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 01:38:15,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:38:15,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:38:15,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:38:15,586 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand 6 states. [2019-09-08 01:38:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:15,787 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2019-09-08 01:38:15,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:38:15,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-09-08 01:38:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:15,788 INFO L225 Difference]: With dead ends: 161 [2019-09-08 01:38:15,789 INFO L226 Difference]: Without dead ends: 141 [2019-09-08 01:38:15,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:38:15,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-08 01:38:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2019-09-08 01:38:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-08 01:38:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2019-09-08 01:38:15,801 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 33 [2019-09-08 01:38:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:15,801 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2019-09-08 01:38:15,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:38:15,802 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2019-09-08 01:38:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-08 01:38:15,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:15,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:15,803 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:15,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:15,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1941174974, now seen corresponding path program 1 times [2019-09-08 01:38:15,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:15,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:15,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:15,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:15,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:15,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:15,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:38:15,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:38:15,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:38:15,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:15,841 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 3 states. [2019-09-08 01:38:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:15,862 INFO L93 Difference]: Finished difference Result 224 states and 258 transitions. [2019-09-08 01:38:15,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:38:15,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-08 01:38:15,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:15,864 INFO L225 Difference]: With dead ends: 224 [2019-09-08 01:38:15,864 INFO L226 Difference]: Without dead ends: 169 [2019-09-08 01:38:15,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:38:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-08 01:38:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142. [2019-09-08 01:38:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-08 01:38:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2019-09-08 01:38:15,877 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 35 [2019-09-08 01:38:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:15,877 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2019-09-08 01:38:15,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:38:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2019-09-08 01:38:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 01:38:15,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:15,878 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:15,879 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:15,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:15,880 INFO L82 PathProgramCache]: Analyzing trace with hash 930038423, now seen corresponding path program 1 times [2019-09-08 01:38:15,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:15,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:15,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:15,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:15,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:16,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:38:16,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:38:16,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:16,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 01:38:16,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:38:16,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-08 01:38:16,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:16,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:16,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-08 01:38:16,094 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:16,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:16,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:16,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-09-08 01:38:16,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:16,206 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 24 treesize of output 10 [2019-09-08 01:38:16,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:16,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:16,220 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-09-08 01:38:16,220 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 24 treesize of output 10 [2019-09-08 01:38:16,221 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:16,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:16,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:16,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-09-08 01:38:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:16,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:38:16,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-08 01:38:16,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:38:16,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:38:16,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:38:16,241 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 10 states. [2019-09-08 01:38:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:16,598 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2019-09-08 01:38:16,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:38:16,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-09-08 01:38:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:16,601 INFO L225 Difference]: With dead ends: 268 [2019-09-08 01:38:16,601 INFO L226 Difference]: Without dead ends: 224 [2019-09-08 01:38:16,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:38:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-08 01:38:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 169. [2019-09-08 01:38:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-08 01:38:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2019-09-08 01:38:16,613 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 36 [2019-09-08 01:38:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:16,614 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2019-09-08 01:38:16,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:38:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2019-09-08 01:38:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:38:16,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:16,615 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:16,615 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:16,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1341973316, now seen corresponding path program 1 times [2019-09-08 01:38:16,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:16,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:16,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:16,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:16,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:17,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:38:17,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:38:17,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:38:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:17,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 01:38:17,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:38:17,073 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-09-08 01:38:17,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:17,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:17,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:17,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-08 01:38:17,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-08 01:38:17,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:17,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:17,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-08 01:38:17,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:17,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:17,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:17,127 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-09-08 01:38:17,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:17,206 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-09-08 01:38:17,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:17,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:17,251 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_41|], 16=[|v_#memory_$Pointer$.base_41|]} [2019-09-08 01:38:17,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:17,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:17,265 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:38:17,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:17,286 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 1 case distinctions, treesize of input 73 treesize of output 58 [2019-09-08 01:38:17,287 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:17,351 INFO L567 ElimStorePlain]: treesize reduction 22, result has 86.8 percent of original size [2019-09-08 01:38:17,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:17,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:17,416 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:17,417 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 3 case distinctions, treesize of input 76 treesize of output 123 [2019-09-08 01:38:17,418 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:17,493 INFO L567 ElimStorePlain]: treesize reduction 78, result has 50.9 percent of original size [2019-09-08 01:38:17,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:17,494 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:191, output treesize:95 [2019-09-08 01:38:17,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:17,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:17,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:17,708 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:17,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 227 [2019-09-08 01:38:17,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:17,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:17,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:17,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:17,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:17,896 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-08 01:38:17,896 INFO L341 Elim1Store]: treesize reduction 60, result has 74.5 percent of original size [2019-09-08 01:38:17,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 128 treesize of output 245 [2019-09-08 01:38:17,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:17,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:17,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:17,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:38:17,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:17,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:38:17,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:17,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:18,222 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-09-08 01:38:18,223 INFO L567 ElimStorePlain]: treesize reduction 1421, result has 15.2 percent of original size [2019-09-08 01:38:18,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:18,412 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-08 01:38:18,413 INFO L341 Elim1Store]: treesize reduction 66, result has 72.6 percent of original size [2019-09-08 01:38:18,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 133 treesize of output 267 [2019-09-08 01:38:18,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,454 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:38:18,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:18,528 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:18,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 225 [2019-09-08 01:38:18,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:38:18,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:38:18,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:38:18,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,552 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:18,782 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 55 [2019-09-08 01:38:18,783 INFO L567 ElimStorePlain]: treesize reduction 1107, result has 16.5 percent of original size [2019-09-08 01:38:18,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,787 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 2 xjuncts. [2019-09-08 01:38:18,788 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:260, output treesize:223 [2019-09-08 01:38:18,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:18,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,455 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-08 01:38:19,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:38:19,510 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_2, v_prenex_3, v_prenex_5, v_prenex_6], 18=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-09-08 01:38:19,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:19,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:19,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 132 [2019-09-08 01:38:19,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,554 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:38:19,700 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2019-09-08 01:38:19,700 INFO L567 ElimStorePlain]: treesize reduction 36, result has 88.3 percent of original size [2019-09-08 01:38:19,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:19,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2019-09-08 01:38:19,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:19,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:19,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:19,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:19,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 132 [2019-09-08 01:38:19,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:19,832 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:38:19,929 INFO L567 ElimStorePlain]: treesize reduction 36, result has 83.3 percent of original size [2019-09-08 01:38:19,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:19,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2019-09-08 01:38:19,944 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:19,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:20,118 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 01:38:20,118 INFO L341 Elim1Store]: treesize reduction 10, result has 92.2 percent of original size [2019-09-08 01:38:20,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 119 treesize of output 184 [2019-09-08 01:38:20,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,161 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:38:20,272 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-09-08 01:38:20,272 INFO L567 ElimStorePlain]: treesize reduction 88, result has 54.2 percent of original size [2019-09-08 01:38:20,301 INFO L341 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2019-09-08 01:38:20,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 68 [2019-09-08 01:38:20,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:20,304 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:20,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:20,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:20,326 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:330, output treesize:7 [2019-09-08 01:38:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:20,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:38:20,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-09-08 01:38:20,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 01:38:20,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 01:38:20,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=213, Unknown=1, NotChecked=0, Total=272 [2019-09-08 01:38:20,363 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand 17 states. [2019-09-08 01:38:20,905 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-08 01:38:21,337 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 61 [2019-09-08 01:38:21,621 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 65 [2019-09-08 01:38:21,942 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-08 01:38:22,134 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-08 01:38:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:22,464 INFO L93 Difference]: Finished difference Result 449 states and 525 transitions. [2019-09-08 01:38:22,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 01:38:22,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2019-09-08 01:38:22,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:22,467 INFO L225 Difference]: With dead ends: 449 [2019-09-08 01:38:22,467 INFO L226 Difference]: Without dead ends: 361 [2019-09-08 01:38:22,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=263, Invalid=790, Unknown=3, NotChecked=0, Total=1056 [2019-09-08 01:38:22,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-09-08 01:38:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 191. [2019-09-08 01:38:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-08 01:38:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 225 transitions. [2019-09-08 01:38:22,483 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 225 transitions. Word has length 40 [2019-09-08 01:38:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:22,483 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 225 transitions. [2019-09-08 01:38:22,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 01:38:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 225 transitions. [2019-09-08 01:38:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:38:22,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:22,484 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:22,489 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:22,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2026576836, now seen corresponding path program 1 times [2019-09-08 01:38:22,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:22,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:22,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:22,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:22,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:23,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:38:23,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:38:23,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:38:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:23,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 01:38:23,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:38:23,210 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-09-08 01:38:23,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:23,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:23,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:23,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-08 01:38:23,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:23,255 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-09-08 01:38:23,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:23,366 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 01:38:23,366 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-09-08 01:38:23,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:23,375 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:38:23,389 INFO L341 Elim1Store]: treesize reduction 87, result has 9.4 percent of original size [2019-09-08 01:38:23,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 193 [2019-09-08 01:38:23,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:23,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:23,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:23,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2019-09-08 01:38:23,430 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:23,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:23,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:23,453 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-09-08 01:38:23,624 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:23,624 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 22 treesize of output 32 [2019-09-08 01:38:23,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:23,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:23,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:23,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:23,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:23,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:23,738 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:38:23,756 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:23,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 85 [2019-09-08 01:38:23,758 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:23,899 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-08 01:38:23,899 INFO L567 ElimStorePlain]: treesize reduction 16, result has 92.7 percent of original size [2019-09-08 01:38:23,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:23,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:23,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:23,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:23,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:38:23,953 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:23,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 137 [2019-09-08 01:38:23,956 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:24,111 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 01:38:24,111 INFO L567 ElimStorePlain]: treesize reduction 132, result has 49.0 percent of original size [2019-09-08 01:38:24,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:24,113 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:276, output treesize:140 [2019-09-08 01:38:24,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:24,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:38:24,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:24,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 157 treesize of output 183 [2019-09-08 01:38:24,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,250 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:38:24,383 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-08 01:38:24,384 INFO L567 ElimStorePlain]: treesize reduction 114, result has 54.9 percent of original size [2019-09-08 01:38:24,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:24,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:24,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:24,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 82 [2019-09-08 01:38:24,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:24,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:24,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:24,428 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:152 [2019-09-08 01:38:24,735 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:38:24,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:24,799 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-09-08 01:38:24,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 165 treesize of output 132 [2019-09-08 01:38:24,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:24,811 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 01:38:24,876 INFO L567 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-09-08 01:38:24,889 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:24,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 46 [2019-09-08 01:38:24,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:24,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:24,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:24,899 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:7 [2019-09-08 01:38:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:24,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:38:24,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-09-08 01:38:24,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 01:38:24,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 01:38:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:38:24,923 INFO L87 Difference]: Start difference. First operand 191 states and 225 transitions. Second operand 19 states. [2019-09-08 01:38:25,767 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 01:38:26,272 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-09-08 01:38:26,548 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-09-08 01:38:26,838 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 109 [2019-09-08 01:38:27,067 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-09-08 01:38:27,212 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 01:38:27,648 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2019-09-08 01:38:28,058 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2019-09-08 01:38:28,358 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-09-08 01:38:28,658 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2019-09-08 01:38:29,018 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 01:38:29,717 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 01:38:30,074 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 01:38:30,491 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-08 01:38:30,653 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 01:38:30,885 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-08 01:38:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:31,087 INFO L93 Difference]: Finished difference Result 752 states and 865 transitions. [2019-09-08 01:38:31,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 01:38:31,088 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-08 01:38:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:31,092 INFO L225 Difference]: With dead ends: 752 [2019-09-08 01:38:31,092 INFO L226 Difference]: Without dead ends: 750 [2019-09-08 01:38:31,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=602, Invalid=1750, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:38:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-09-08 01:38:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 225. [2019-09-08 01:38:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-08 01:38:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2019-09-08 01:38:31,115 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 40 [2019-09-08 01:38:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:31,115 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2019-09-08 01:38:31,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 01:38:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2019-09-08 01:38:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 01:38:31,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:31,116 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:31,117 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:31,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:31,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1168199972, now seen corresponding path program 1 times [2019-09-08 01:38:31,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:31,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:31,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:31,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:31,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:31,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:38:31,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 01:38:31,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:38:31,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:38:31,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:38:31,177 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand 5 states. [2019-09-08 01:38:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:31,293 INFO L93 Difference]: Finished difference Result 291 states and 342 transitions. [2019-09-08 01:38:31,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:38:31,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-08 01:38:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:31,295 INFO L225 Difference]: With dead ends: 291 [2019-09-08 01:38:31,295 INFO L226 Difference]: Without dead ends: 177 [2019-09-08 01:38:31,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:38:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-08 01:38:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-08 01:38:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-08 01:38:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2019-09-08 01:38:31,312 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 42 [2019-09-08 01:38:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:31,313 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2019-09-08 01:38:31,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:38:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2019-09-08 01:38:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 01:38:31,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:31,314 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:31,315 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:31,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:31,315 INFO L82 PathProgramCache]: Analyzing trace with hash 608870837, now seen corresponding path program 1 times [2019-09-08 01:38:31,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:31,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:31,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:31,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:32,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:38:32,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:38:32,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:32,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 01:38:32,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:38:32,068 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-09-08 01:38:32,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:32,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:32,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:32,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-08 01:38:32,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:32,108 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-09-08 01:38:32,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:32,179 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-09-08 01:38:32,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:32,202 INFO L341 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2019-09-08 01:38:32,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 130 [2019-09-08 01:38:32,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:32,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:32,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:32,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2019-09-08 01:38:32,236 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:32,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:32,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:32,260 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-09-08 01:38:32,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:32,384 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 22 treesize of output 32 [2019-09-08 01:38:32,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:32,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:32,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:32,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:32,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:32,481 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:38:32,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:32,487 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:38:32,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:32,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 137 [2019-09-08 01:38:32,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:32,701 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 01:38:32,701 INFO L567 ElimStorePlain]: treesize reduction 132, result has 59.4 percent of original size [2019-09-08 01:38:32,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:32,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:32,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:32,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:32,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 85 [2019-09-08 01:38:32,744 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:32,832 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.8 percent of original size [2019-09-08 01:38:32,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:32,833 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:276, output treesize:140 [2019-09-08 01:38:32,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:32,925 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:38:32,968 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:32,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 157 treesize of output 183 [2019-09-08 01:38:32,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:32,990 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:38:33,132 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-08 01:38:33,133 INFO L567 ElimStorePlain]: treesize reduction 114, result has 54.9 percent of original size [2019-09-08 01:38:33,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:33,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:33,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:38:33,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 82 [2019-09-08 01:38:33,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:33,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:33,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:33,197 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:152 [2019-09-08 01:38:33,644 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-09-08 01:38:33,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 161 treesize of output 130 [2019-09-08 01:38:33,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:33,665 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 01:38:33,745 INFO L567 ElimStorePlain]: treesize reduction 32, result has 71.4 percent of original size [2019-09-08 01:38:33,760 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:33,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 44 [2019-09-08 01:38:33,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:38:33,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:33,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:38:33,772 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:175, output treesize:7 [2019-09-08 01:38:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:33,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:38:33,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2019-09-08 01:38:33,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 01:38:33,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 01:38:33,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:38:33,824 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 20 states. [2019-09-08 01:38:34,501 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 01:38:35,000 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 01:38:35,532 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 01:38:35,812 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-09-08 01:38:36,090 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-09-08 01:38:36,375 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 109 [2019-09-08 01:38:36,616 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-09-08 01:38:36,750 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 01:38:36,900 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 01:38:37,185 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2019-09-08 01:38:37,556 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-08 01:38:37,902 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2019-09-08 01:38:38,293 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-09-08 01:38:38,558 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-08 01:38:38,880 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 01:38:39,132 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-08 01:38:39,486 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-08 01:38:39,664 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 01:38:40,094 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 01:38:40,464 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-08 01:38:40,759 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-08 01:38:40,936 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-08 01:38:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:38:41,091 INFO L93 Difference]: Finished difference Result 579 states and 633 transitions. [2019-09-08 01:38:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 01:38:41,093 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-09-08 01:38:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:38:41,097 INFO L225 Difference]: With dead ends: 579 [2019-09-08 01:38:41,097 INFO L226 Difference]: Without dead ends: 577 [2019-09-08 01:38:41,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=686, Invalid=1966, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:38:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-08 01:38:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 203. [2019-09-08 01:38:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-08 01:38:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 233 transitions. [2019-09-08 01:38:41,117 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 233 transitions. Word has length 43 [2019-09-08 01:38:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:38:41,117 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 233 transitions. [2019-09-08 01:38:41,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 01:38:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 233 transitions. [2019-09-08 01:38:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 01:38:41,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:38:41,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:38:41,119 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:38:41,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:38:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash 938403788, now seen corresponding path program 1 times [2019-09-08 01:38:41,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:38:41,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:38:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:41,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:38:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:41,620 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-09-08 01:38:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:38:41,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:38:41,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:38:41,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:38:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:38:41,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 01:38:41,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:38:41,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:41,988 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 54 [2019-09-08 01:38:41,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:41,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:38:41,990 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:38:42,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:38:42,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:38:42,205 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:146) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-08 01:38:42,211 INFO L168 Benchmark]: Toolchain (without parser) took 34313.94 ms. Allocated memory was 133.7 MB in the beginning and 498.1 MB in the end (delta: 364.4 MB). Free memory was 88.5 MB in the beginning and 162.9 MB in the end (delta: -74.4 MB). Peak memory consumption was 290.0 MB. Max. memory is 7.1 GB. [2019-09-08 01:38:42,212 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:38:42,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.09 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 88.3 MB in the beginning and 163.9 MB in the end (delta: -75.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2019-09-08 01:38:42,213 INFO L168 Benchmark]: Boogie Preprocessor took 82.61 ms. Allocated memory is still 199.8 MB. Free memory was 163.9 MB in the beginning and 160.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-09-08 01:38:42,213 INFO L168 Benchmark]: RCFGBuilder took 836.09 ms. Allocated memory is still 199.8 MB. Free memory was 160.7 MB in the beginning and 106.3 MB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 7.1 GB. [2019-09-08 01:38:42,214 INFO L168 Benchmark]: TraceAbstraction took 32651.67 ms. Allocated memory was 199.8 MB in the beginning and 498.1 MB in the end (delta: 298.3 MB). Free memory was 106.3 MB in the beginning and 162.9 MB in the end (delta: -56.6 MB). Peak memory consumption was 241.7 MB. Max. memory is 7.1 GB. [2019-09-08 01:38:42,216 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 737.09 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 88.3 MB in the beginning and 163.9 MB in the end (delta: -75.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.61 ms. Allocated memory is still 199.8 MB. Free memory was 163.9 MB in the beginning and 160.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.09 ms. Allocated memory is still 199.8 MB. Free memory was 160.7 MB in the beginning and 106.3 MB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32651.67 ms. Allocated memory was 199.8 MB in the beginning and 498.1 MB in the end (delta: 298.3 MB). Free memory was 106.3 MB in the beginning and 162.9 MB in the end (delta: -56.6 MB). Peak memory consumption was 241.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...