/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:19:50,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:19:50,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:19:50,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:19:50,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:19:50,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:19:50,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:19:50,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:19:50,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:19:50,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:19:50,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:19:50,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:19:50,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:19:50,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:19:50,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:19:50,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:19:50,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:19:50,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:19:50,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:19:50,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:19:50,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:19:50,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:19:50,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:19:50,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:19:50,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:19:50,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:19:50,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:19:50,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:19:50,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:19:50,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:19:50,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:19:50,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:19:50,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:19:50,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:19:50,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:19:50,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:19:50,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:19:50,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:19:50,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:19:50,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:19:50,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:19:50,913 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-11-23 22:19:50,934 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:19:50,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:19:50,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:19:50,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:19:50,937 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:19:50,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:19:50,938 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:19:50,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:19:50,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:19:50,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:19:50,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:19:50,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:19:50,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:19:50,940 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:19:50,940 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:19:50,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:19:50,941 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:19:50,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:19:50,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:19:50,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:19:50,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:19:50,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:19:50,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:19:50,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:19:50,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:19:50,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:19:50,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:19:50,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:19:50,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:19:50,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:19:51,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:19:51,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:19:51,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:19:51,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:19:51,220 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:19:51,221 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-1.c [2019-11-23 22:19:51,290 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07df2bc7f/def8d94f49414274a922d96b82b61d67/FLAG2d1b4cf49 [2019-11-23 22:19:51,818 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:19:51,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-1.c [2019-11-23 22:19:51,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07df2bc7f/def8d94f49414274a922d96b82b61d67/FLAG2d1b4cf49 [2019-11-23 22:19:52,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07df2bc7f/def8d94f49414274a922d96b82b61d67 [2019-11-23 22:19:52,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:19:52,068 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:19:52,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:19:52,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:19:52,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:19:52,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:19:52" (1/1) ... [2019-11-23 22:19:52,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16746fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52, skipping insertion in model container [2019-11-23 22:19:52,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:19:52" (1/1) ... [2019-11-23 22:19:52,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:19:52,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:19:52,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:19:52,644 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:19:52,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:19:52,780 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:19:52,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52 WrapperNode [2019-11-23 22:19:52,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:19:52,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:19:52,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:19:52,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:19:52,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52" (1/1) ... [2019-11-23 22:19:52,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52" (1/1) ... [2019-11-23 22:19:52,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:19:52,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:19:52,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:19:52,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:19:52,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52" (1/1) ... [2019-11-23 22:19:52,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52" (1/1) ... [2019-11-23 22:19:52,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52" (1/1) ... [2019-11-23 22:19:52,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52" (1/1) ... [2019-11-23 22:19:52,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52" (1/1) ... [2019-11-23 22:19:53,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52" (1/1) ... [2019-11-23 22:19:53,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52" (1/1) ... [2019-11-23 22:19:53,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:19:53,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:19:53,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:19:53,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:19:53,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:19:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:19:53,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:19:53,550 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,579 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,587 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,595 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,596 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,597 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,600 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,604 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,606 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,608 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,609 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,610 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,612 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,614 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,615 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,616 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,618 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,620 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,621 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,621 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,623 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,625 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,629 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,636 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,637 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,639 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,641 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,642 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,642 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:53,644 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2019-11-23 22:19:54,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2019-11-23 22:19:54,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2019-11-23 22:19:54,984 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2019-11-23 22:19:54,984 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2019-11-23 22:19:54,984 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2019-11-23 22:19:54,984 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2019-11-23 22:19:54,984 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2019-11-23 22:19:54,984 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2019-11-23 22:19:54,985 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2019-11-23 22:19:54,985 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-23 22:19:54,985 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-23 22:19:54,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-23 22:19:54,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-23 22:19:54,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2019-11-23 22:19:54,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2019-11-23 22:19:54,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2019-11-23 22:19:54,987 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2019-11-23 22:19:54,987 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-23 22:19:54,987 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-23 22:19:54,988 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2019-11-23 22:19:54,988 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2019-11-23 22:19:54,989 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2019-11-23 22:19:54,989 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2019-11-23 22:19:54,989 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2019-11-23 22:19:54,989 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2019-11-23 22:19:54,989 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2019-11-23 22:19:54,989 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2019-11-23 22:19:54,990 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2019-11-23 22:19:54,990 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2019-11-23 22:19:54,990 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2019-11-23 22:19:54,990 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2019-11-23 22:19:54,990 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2019-11-23 22:19:54,991 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2019-11-23 22:19:54,991 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2019-11-23 22:19:54,992 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2019-11-23 22:19:54,994 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-11-23 22:19:54,995 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-11-23 22:19:55,000 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2019-11-23 22:19:55,000 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2019-11-23 22:19:55,000 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2019-11-23 22:19:55,000 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2019-11-23 22:19:55,001 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2019-11-23 22:19:55,001 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2019-11-23 22:19:55,001 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2019-11-23 22:19:55,001 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2019-11-23 22:19:55,001 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2019-11-23 22:19:55,002 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2019-11-23 22:19:55,002 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2019-11-23 22:19:55,002 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2019-11-23 22:19:55,002 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-11-23 22:19:55,002 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-11-23 22:19:55,002 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2019-11-23 22:19:55,003 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2019-11-23 22:19:55,003 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-11-23 22:19:55,003 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-11-23 22:19:55,003 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2019-11-23 22:19:55,003 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2019-11-23 22:19:55,003 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-11-23 22:19:55,003 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-11-23 22:19:55,005 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:19:55,005 INFO L284 CfgBuilder]: Removed 277 assume(true) statements. [2019-11-23 22:19:55,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:19:55 BoogieIcfgContainer [2019-11-23 22:19:55,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:19:55,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:19:55,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:19:55,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:19:55,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:19:52" (1/3) ... [2019-11-23 22:19:55,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5373c129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:19:55, skipping insertion in model container [2019-11-23 22:19:55,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:52" (2/3) ... [2019-11-23 22:19:55,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5373c129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:19:55, skipping insertion in model container [2019-11-23 22:19:55,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:19:55" (3/3) ... [2019-11-23 22:19:55,017 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-1.c [2019-11-23 22:19:55,026 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:19:55,037 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 54 error locations. [2019-11-23 22:19:55,050 INFO L249 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2019-11-23 22:19:55,096 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:19:55,096 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:19:55,096 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:19:55,097 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:19:55,097 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:19:55,097 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:19:55,098 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:19:55,098 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:19:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states. [2019-11-23 22:19:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 22:19:55,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:55,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:55,134 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:55,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:55,140 INFO L82 PathProgramCache]: Analyzing trace with hash 538056098, now seen corresponding path program 1 times [2019-11-23 22:19:55,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:55,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728761992] [2019-11-23 22:19:55,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:55,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728761992] [2019-11-23 22:19:55,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:55,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:55,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942515113] [2019-11-23 22:19:55,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:55,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:55,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:55,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:55,359 INFO L87 Difference]: Start difference. First operand 572 states. Second operand 3 states. [2019-11-23 22:19:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:55,764 INFO L93 Difference]: Finished difference Result 1136 states and 1626 transitions. [2019-11-23 22:19:55,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:55,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-23 22:19:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:55,798 INFO L225 Difference]: With dead ends: 1136 [2019-11-23 22:19:55,799 INFO L226 Difference]: Without dead ends: 692 [2019-11-23 22:19:55,810 INFO L630 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-11-23 22:19:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-11-23 22:19:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 666. [2019-11-23 22:19:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-11-23 22:19:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 905 transitions. [2019-11-23 22:19:55,893 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 905 transitions. Word has length 10 [2019-11-23 22:19:55,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:55,893 INFO L462 AbstractCegarLoop]: Abstraction has 666 states and 905 transitions. [2019-11-23 22:19:55,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 905 transitions. [2019-11-23 22:19:55,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 22:19:55,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:55,894 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:55,895 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:55,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash 369677969, now seen corresponding path program 1 times [2019-11-23 22:19:55,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:55,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297248191] [2019-11-23 22:19:55,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:55,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297248191] [2019-11-23 22:19:55,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:55,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:55,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578672830] [2019-11-23 22:19:55,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:55,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:55,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:55,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:55,941 INFO L87 Difference]: Start difference. First operand 666 states and 905 transitions. Second operand 3 states. [2019-11-23 22:19:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:55,972 INFO L93 Difference]: Finished difference Result 688 states and 930 transitions. [2019-11-23 22:19:55,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:55,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-23 22:19:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:55,976 INFO L225 Difference]: With dead ends: 688 [2019-11-23 22:19:55,976 INFO L226 Difference]: Without dead ends: 666 [2019-11-23 22:19:55,977 INFO L630 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-11-23 22:19:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-11-23 22:19:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-11-23 22:19:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-11-23 22:19:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 904 transitions. [2019-11-23 22:19:56,010 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 904 transitions. Word has length 11 [2019-11-23 22:19:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:56,011 INFO L462 AbstractCegarLoop]: Abstraction has 666 states and 904 transitions. [2019-11-23 22:19:56,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 904 transitions. [2019-11-23 22:19:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:19:56,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:56,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:56,013 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:56,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:56,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1535696421, now seen corresponding path program 1 times [2019-11-23 22:19:56,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:56,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552961658] [2019-11-23 22:19:56,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:56,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552961658] [2019-11-23 22:19:56,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:56,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:56,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857437165] [2019-11-23 22:19:56,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:56,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:56,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:56,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:56,123 INFO L87 Difference]: Start difference. First operand 666 states and 904 transitions. Second operand 3 states. [2019-11-23 22:19:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:56,215 INFO L93 Difference]: Finished difference Result 762 states and 1022 transitions. [2019-11-23 22:19:56,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:56,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:19:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:56,220 INFO L225 Difference]: With dead ends: 762 [2019-11-23 22:19:56,221 INFO L226 Difference]: Without dead ends: 735 [2019-11-23 22:19:56,221 INFO L630 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-11-23 22:19:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-11-23 22:19:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 686. [2019-11-23 22:19:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-11-23 22:19:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 941 transitions. [2019-11-23 22:19:56,257 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 941 transitions. Word has length 16 [2019-11-23 22:19:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:56,257 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 941 transitions. [2019-11-23 22:19:56,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 941 transitions. [2019-11-23 22:19:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:19:56,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:56,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:56,261 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:56,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:56,262 INFO L82 PathProgramCache]: Analyzing trace with hash 107438083, now seen corresponding path program 1 times [2019-11-23 22:19:56,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:56,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775463879] [2019-11-23 22:19:56,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:56,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775463879] [2019-11-23 22:19:56,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:56,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:56,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213759008] [2019-11-23 22:19:56,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:56,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:56,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:56,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:56,375 INFO L87 Difference]: Start difference. First operand 686 states and 941 transitions. Second operand 3 states. [2019-11-23 22:19:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:56,598 INFO L93 Difference]: Finished difference Result 723 states and 987 transitions. [2019-11-23 22:19:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:56,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:19:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:56,603 INFO L225 Difference]: With dead ends: 723 [2019-11-23 22:19:56,603 INFO L226 Difference]: Without dead ends: 718 [2019-11-23 22:19:56,604 INFO L630 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-11-23 22:19:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-11-23 22:19:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 715. [2019-11-23 22:19:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-23 22:19:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 979 transitions. [2019-11-23 22:19:56,632 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 979 transitions. Word has length 19 [2019-11-23 22:19:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:56,632 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 979 transitions. [2019-11-23 22:19:56,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 979 transitions. [2019-11-23 22:19:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:19:56,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:56,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:56,635 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:56,635 INFO L82 PathProgramCache]: Analyzing trace with hash 98463890, now seen corresponding path program 1 times [2019-11-23 22:19:56,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:56,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772731350] [2019-11-23 22:19:56,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:56,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772731350] [2019-11-23 22:19:56,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:56,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:56,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042336263] [2019-11-23 22:19:56,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:56,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:56,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:56,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:56,708 INFO L87 Difference]: Start difference. First operand 715 states and 979 transitions. Second operand 3 states. [2019-11-23 22:19:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:56,780 INFO L93 Difference]: Finished difference Result 1230 states and 1671 transitions. [2019-11-23 22:19:56,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:56,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:19:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:56,785 INFO L225 Difference]: With dead ends: 1230 [2019-11-23 22:19:56,786 INFO L226 Difference]: Without dead ends: 858 [2019-11-23 22:19:56,787 INFO L630 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-11-23 22:19:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-11-23 22:19:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 697. [2019-11-23 22:19:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-11-23 22:19:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 955 transitions. [2019-11-23 22:19:56,820 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 955 transitions. Word has length 19 [2019-11-23 22:19:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:56,821 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 955 transitions. [2019-11-23 22:19:56,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 955 transitions. [2019-11-23 22:19:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:19:56,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:56,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:56,823 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:56,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:56,823 INFO L82 PathProgramCache]: Analyzing trace with hash -946806949, now seen corresponding path program 1 times [2019-11-23 22:19:56,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:56,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057717398] [2019-11-23 22:19:56,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:56,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057717398] [2019-11-23 22:19:56,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:56,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:56,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463831139] [2019-11-23 22:19:56,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:56,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:56,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:56,887 INFO L87 Difference]: Start difference. First operand 697 states and 955 transitions. Second operand 4 states. [2019-11-23 22:19:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:56,980 INFO L93 Difference]: Finished difference Result 709 states and 968 transitions. [2019-11-23 22:19:56,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:56,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-23 22:19:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:56,985 INFO L225 Difference]: With dead ends: 709 [2019-11-23 22:19:56,985 INFO L226 Difference]: Without dead ends: 689 [2019-11-23 22:19:56,986 INFO L630 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-11-23 22:19:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-11-23 22:19:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-11-23 22:19:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-23 22:19:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 945 transitions. [2019-11-23 22:19:57,021 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 945 transitions. Word has length 20 [2019-11-23 22:19:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:57,021 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 945 transitions. [2019-11-23 22:19:57,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 945 transitions. [2019-11-23 22:19:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:19:57,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,025 INFO L410 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] [2019-11-23 22:19:57,026 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2136813194, now seen corresponding path program 1 times [2019-11-23 22:19:57,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338886333] [2019-11-23 22:19:57,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338886333] [2019-11-23 22:19:57,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:57,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94609623] [2019-11-23 22:19:57,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:57,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:57,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,086 INFO L87 Difference]: Start difference. First operand 689 states and 945 transitions. Second operand 3 states. [2019-11-23 22:19:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:57,262 INFO L93 Difference]: Finished difference Result 689 states and 945 transitions. [2019-11-23 22:19:57,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:57,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:19:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:57,268 INFO L225 Difference]: With dead ends: 689 [2019-11-23 22:19:57,268 INFO L226 Difference]: Without dead ends: 673 [2019-11-23 22:19:57,268 INFO L630 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-11-23 22:19:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-11-23 22:19:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2019-11-23 22:19:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-23 22:19:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 928 transitions. [2019-11-23 22:19:57,298 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 928 transitions. Word has length 23 [2019-11-23 22:19:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:57,298 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 928 transitions. [2019-11-23 22:19:57,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:57,299 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 928 transitions. [2019-11-23 22:19:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:19:57,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,300 INFO L410 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-11-23 22:19:57,301 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1059387616, now seen corresponding path program 1 times [2019-11-23 22:19:57,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374036172] [2019-11-23 22:19:57,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374036172] [2019-11-23 22:19:57,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:57,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908266155] [2019-11-23 22:19:57,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:57,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:57,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:57,379 INFO L87 Difference]: Start difference. First operand 673 states and 928 transitions. Second operand 4 states. [2019-11-23 22:19:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:57,438 INFO L93 Difference]: Finished difference Result 686 states and 942 transitions. [2019-11-23 22:19:57,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:57,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-23 22:19:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:57,444 INFO L225 Difference]: With dead ends: 686 [2019-11-23 22:19:57,444 INFO L226 Difference]: Without dead ends: 671 [2019-11-23 22:19:57,445 INFO L630 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-11-23 22:19:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-23 22:19:57,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-11-23 22:19:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-11-23 22:19:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-11-23 22:19:57,473 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 24 [2019-11-23 22:19:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:57,475 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-11-23 22:19:57,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-11-23 22:19:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:19:57,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,476 INFO L410 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-11-23 22:19:57,477 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1371761021, now seen corresponding path program 1 times [2019-11-23 22:19:57,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488085495] [2019-11-23 22:19:57,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488085495] [2019-11-23 22:19:57,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:57,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262782184] [2019-11-23 22:19:57,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:57,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:57,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,518 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-11-23 22:19:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:57,733 INFO L93 Difference]: Finished difference Result 873 states and 1195 transitions. [2019-11-23 22:19:57,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:57,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:19:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:57,739 INFO L225 Difference]: With dead ends: 873 [2019-11-23 22:19:57,740 INFO L226 Difference]: Without dead ends: 865 [2019-11-23 22:19:57,740 INFO L630 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-11-23 22:19:57,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-11-23 22:19:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 689. [2019-11-23 22:19:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-23 22:19:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 952 transitions. [2019-11-23 22:19:57,800 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 952 transitions. Word has length 25 [2019-11-23 22:19:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:57,800 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 952 transitions. [2019-11-23 22:19:57,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 952 transitions. [2019-11-23 22:19:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:19:57,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,802 INFO L410 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] [2019-11-23 22:19:57,802 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash 417423376, now seen corresponding path program 1 times [2019-11-23 22:19:57,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474217973] [2019-11-23 22:19:57,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474217973] [2019-11-23 22:19:57,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:19:57,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498574095] [2019-11-23 22:19:57,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:19:57,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:19:57,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:19:57,858 INFO L87 Difference]: Start difference. First operand 689 states and 952 transitions. Second operand 7 states. [2019-11-23 22:19:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,461 INFO L93 Difference]: Finished difference Result 1033 states and 1388 transitions. [2019-11-23 22:19:58,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:19:58,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-23 22:19:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,465 INFO L225 Difference]: With dead ends: 1033 [2019-11-23 22:19:58,466 INFO L226 Difference]: Without dead ends: 774 [2019-11-23 22:19:58,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:19:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-11-23 22:19:58,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 672. [2019-11-23 22:19:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-11-23 22:19:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 916 transitions. [2019-11-23 22:19:58,498 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 916 transitions. Word has length 26 [2019-11-23 22:19:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,498 INFO L462 AbstractCegarLoop]: Abstraction has 672 states and 916 transitions. [2019-11-23 22:19:58,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:19:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 916 transitions. [2019-11-23 22:19:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:19:58,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,501 INFO L410 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] [2019-11-23 22:19:58,502 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,502 INFO L82 PathProgramCache]: Analyzing trace with hash -65568844, now seen corresponding path program 1 times [2019-11-23 22:19:58,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455142052] [2019-11-23 22:19:58,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455142052] [2019-11-23 22:19:58,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:58,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94719803] [2019-11-23 22:19:58,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:58,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:58,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:58,537 INFO L87 Difference]: Start difference. First operand 672 states and 916 transitions. Second operand 4 states. [2019-11-23 22:19:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,597 INFO L93 Difference]: Finished difference Result 685 states and 930 transitions. [2019-11-23 22:19:58,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:58,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-23 22:19:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,601 INFO L225 Difference]: With dead ends: 685 [2019-11-23 22:19:58,601 INFO L226 Difference]: Without dead ends: 670 [2019-11-23 22:19:58,602 INFO L630 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-11-23 22:19:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-23 22:19:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2019-11-23 22:19:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-23 22:19:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 913 transitions. [2019-11-23 22:19:58,677 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 913 transitions. Word has length 26 [2019-11-23 22:19:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,681 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 913 transitions. [2019-11-23 22:19:58,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 913 transitions. [2019-11-23 22:19:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:19:58,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,682 INFO L410 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-11-23 22:19:58,682 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2044140679, now seen corresponding path program 1 times [2019-11-23 22:19:58,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285551601] [2019-11-23 22:19:58,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285551601] [2019-11-23 22:19:58,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:58,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509432435] [2019-11-23 22:19:58,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:58,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:58,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:58,729 INFO L87 Difference]: Start difference. First operand 670 states and 913 transitions. Second operand 4 states. [2019-11-23 22:19:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,796 INFO L93 Difference]: Finished difference Result 708 states and 954 transitions. [2019-11-23 22:19:58,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:58,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-23 22:19:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,800 INFO L225 Difference]: With dead ends: 708 [2019-11-23 22:19:58,800 INFO L226 Difference]: Without dead ends: 687 [2019-11-23 22:19:58,800 INFO L630 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-11-23 22:19:58,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-23 22:19:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 672. [2019-11-23 22:19:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-11-23 22:19:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 915 transitions. [2019-11-23 22:19:58,832 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 915 transitions. Word has length 27 [2019-11-23 22:19:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,832 INFO L462 AbstractCegarLoop]: Abstraction has 672 states and 915 transitions. [2019-11-23 22:19:58,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 915 transitions. [2019-11-23 22:19:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:19:58,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,834 INFO L410 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-11-23 22:19:58,834 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,835 INFO L82 PathProgramCache]: Analyzing trace with hash -610986493, now seen corresponding path program 1 times [2019-11-23 22:19:58,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079085006] [2019-11-23 22:19:58,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079085006] [2019-11-23 22:19:58,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:58,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599086023] [2019-11-23 22:19:58,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:58,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:58,863 INFO L87 Difference]: Start difference. First operand 672 states and 915 transitions. Second operand 3 states. [2019-11-23 22:19:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,907 INFO L93 Difference]: Finished difference Result 703 states and 951 transitions. [2019-11-23 22:19:58,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:58,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:19:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,910 INFO L225 Difference]: With dead ends: 703 [2019-11-23 22:19:58,911 INFO L226 Difference]: Without dead ends: 661 [2019-11-23 22:19:58,911 INFO L630 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-11-23 22:19:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-11-23 22:19:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 658. [2019-11-23 22:19:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-23 22:19:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 891 transitions. [2019-11-23 22:19:58,938 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 891 transitions. Word has length 27 [2019-11-23 22:19:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,938 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 891 transitions. [2019-11-23 22:19:58,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 891 transitions. [2019-11-23 22:19:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:19:58,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,940 INFO L410 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-11-23 22:19:58,940 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1636712997, now seen corresponding path program 1 times [2019-11-23 22:19:58,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681676564] [2019-11-23 22:19:58,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681676564] [2019-11-23 22:19:58,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:58,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111008710] [2019-11-23 22:19:58,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:58,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:58,981 INFO L87 Difference]: Start difference. First operand 658 states and 891 transitions. Second operand 4 states. [2019-11-23 22:19:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,051 INFO L93 Difference]: Finished difference Result 696 states and 932 transitions. [2019-11-23 22:19:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:59,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-23 22:19:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,055 INFO L225 Difference]: With dead ends: 696 [2019-11-23 22:19:59,055 INFO L226 Difference]: Without dead ends: 675 [2019-11-23 22:19:59,056 INFO L630 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-11-23 22:19:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-23 22:19:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 658. [2019-11-23 22:19:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-23 22:19:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 891 transitions. [2019-11-23 22:19:59,083 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 891 transitions. Word has length 28 [2019-11-23 22:19:59,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,083 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 891 transitions. [2019-11-23 22:19:59,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:59,084 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 891 transitions. [2019-11-23 22:19:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:19:59,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,085 INFO L410 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] [2019-11-23 22:19:59,085 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,085 INFO L82 PathProgramCache]: Analyzing trace with hash 615538312, now seen corresponding path program 1 times [2019-11-23 22:19:59,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247118789] [2019-11-23 22:19:59,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247118789] [2019-11-23 22:19:59,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:19:59,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076691954] [2019-11-23 22:19:59,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:19:59,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:19:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:19:59,157 INFO L87 Difference]: Start difference. First operand 658 states and 891 transitions. Second operand 8 states. [2019-11-23 22:19:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,757 INFO L93 Difference]: Finished difference Result 680 states and 913 transitions. [2019-11-23 22:19:59,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:19:59,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-23 22:19:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,760 INFO L225 Difference]: With dead ends: 680 [2019-11-23 22:19:59,761 INFO L226 Difference]: Without dead ends: 675 [2019-11-23 22:19:59,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:19:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-23 22:19:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 668. [2019-11-23 22:19:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-11-23 22:19:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 901 transitions. [2019-11-23 22:19:59,795 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 901 transitions. Word has length 29 [2019-11-23 22:19:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,796 INFO L462 AbstractCegarLoop]: Abstraction has 668 states and 901 transitions. [2019-11-23 22:19:59,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:19:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 901 transitions. [2019-11-23 22:19:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:19:59,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,797 INFO L410 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-11-23 22:19:59,798 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1368856645, now seen corresponding path program 1 times [2019-11-23 22:19:59,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199027294] [2019-11-23 22:19:59,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199027294] [2019-11-23 22:19:59,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:19:59,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087247702] [2019-11-23 22:19:59,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:19:59,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:19:59,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:19:59,881 INFO L87 Difference]: Start difference. First operand 668 states and 901 transitions. Second operand 8 states. [2019-11-23 22:20:00,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:00,433 INFO L93 Difference]: Finished difference Result 680 states and 912 transitions. [2019-11-23 22:20:00,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:00,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-23 22:20:00,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:00,437 INFO L225 Difference]: With dead ends: 680 [2019-11-23 22:20:00,437 INFO L226 Difference]: Without dead ends: 675 [2019-11-23 22:20:00,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:20:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-23 22:20:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 669. [2019-11-23 22:20:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-11-23 22:20:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 902 transitions. [2019-11-23 22:20:00,471 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 902 transitions. Word has length 30 [2019-11-23 22:20:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:00,471 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 902 transitions. [2019-11-23 22:20:00,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:20:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 902 transitions. [2019-11-23 22:20:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:20:00,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:00,472 INFO L410 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-11-23 22:20:00,473 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:00,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:00,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1926759716, now seen corresponding path program 1 times [2019-11-23 22:20:00,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:00,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771206917] [2019-11-23 22:20:00,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:00,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771206917] [2019-11-23 22:20:00,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:00,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:00,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265024518] [2019-11-23 22:20:00,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:00,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:00,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:00,515 INFO L87 Difference]: Start difference. First operand 669 states and 902 transitions. Second operand 5 states. [2019-11-23 22:20:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:00,618 INFO L93 Difference]: Finished difference Result 684 states and 918 transitions. [2019-11-23 22:20:00,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:00,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-23 22:20:00,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:00,621 INFO L225 Difference]: With dead ends: 684 [2019-11-23 22:20:00,622 INFO L226 Difference]: Without dead ends: 667 [2019-11-23 22:20:00,622 INFO L630 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-11-23 22:20:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-11-23 22:20:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2019-11-23 22:20:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-11-23 22:20:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 897 transitions. [2019-11-23 22:20:00,712 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 897 transitions. Word has length 30 [2019-11-23 22:20:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:00,712 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 897 transitions. [2019-11-23 22:20:00,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 897 transitions. [2019-11-23 22:20:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:20:00,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:00,713 INFO L410 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-11-23 22:20:00,714 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash 455234987, now seen corresponding path program 1 times [2019-11-23 22:20:00,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:00,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786870899] [2019-11-23 22:20:00,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:00,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786870899] [2019-11-23 22:20:00,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:00,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:20:00,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026179031] [2019-11-23 22:20:00,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:20:00,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:00,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:20:00,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:00,787 INFO L87 Difference]: Start difference. First operand 667 states and 897 transitions. Second operand 9 states. [2019-11-23 22:20:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:01,516 INFO L93 Difference]: Finished difference Result 693 states and 921 transitions. [2019-11-23 22:20:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:01,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-23 22:20:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:01,520 INFO L225 Difference]: With dead ends: 693 [2019-11-23 22:20:01,520 INFO L226 Difference]: Without dead ends: 684 [2019-11-23 22:20:01,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:20:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-11-23 22:20:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 667. [2019-11-23 22:20:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-11-23 22:20:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 895 transitions. [2019-11-23 22:20:01,553 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 895 transitions. Word has length 30 [2019-11-23 22:20:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:01,553 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 895 transitions. [2019-11-23 22:20:01,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:20:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 895 transitions. [2019-11-23 22:20:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:20:01,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:01,554 INFO L410 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-11-23 22:20:01,555 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:01,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:01,555 INFO L82 PathProgramCache]: Analyzing trace with hash -879074465, now seen corresponding path program 1 times [2019-11-23 22:20:01,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:01,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119048124] [2019-11-23 22:20:01,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:01,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119048124] [2019-11-23 22:20:01,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:01,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:01,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842432942] [2019-11-23 22:20:01,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:01,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:01,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:01,602 INFO L87 Difference]: Start difference. First operand 667 states and 895 transitions. Second operand 5 states. [2019-11-23 22:20:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:01,692 INFO L93 Difference]: Finished difference Result 673 states and 900 transitions. [2019-11-23 22:20:01,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:01,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-23 22:20:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:01,696 INFO L225 Difference]: With dead ends: 673 [2019-11-23 22:20:01,696 INFO L226 Difference]: Without dead ends: 650 [2019-11-23 22:20:01,696 INFO L630 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-11-23 22:20:01,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-23 22:20:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-11-23 22:20:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-11-23 22:20:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 866 transitions. [2019-11-23 22:20:01,730 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 866 transitions. Word has length 31 [2019-11-23 22:20:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:01,731 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 866 transitions. [2019-11-23 22:20:01,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 866 transitions. [2019-11-23 22:20:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:20:01,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:01,732 INFO L410 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-11-23 22:20:01,732 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:01,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:01,733 INFO L82 PathProgramCache]: Analyzing trace with hash 932056973, now seen corresponding path program 1 times [2019-11-23 22:20:01,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:01,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794380344] [2019-11-23 22:20:01,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:01,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794380344] [2019-11-23 22:20:01,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:01,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:01,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117293996] [2019-11-23 22:20:01,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:01,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:01,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:01,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:01,769 INFO L87 Difference]: Start difference. First operand 650 states and 866 transitions. Second operand 3 states. [2019-11-23 22:20:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:01,960 INFO L93 Difference]: Finished difference Result 839 states and 1102 transitions. [2019-11-23 22:20:01,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:01,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:20:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:01,992 INFO L225 Difference]: With dead ends: 839 [2019-11-23 22:20:01,992 INFO L226 Difference]: Without dead ends: 826 [2019-11-23 22:20:01,992 INFO L630 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-11-23 22:20:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-11-23 22:20:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 702. [2019-11-23 22:20:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-11-23 22:20:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 926 transitions. [2019-11-23 22:20:02,025 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 926 transitions. Word has length 31 [2019-11-23 22:20:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:02,026 INFO L462 AbstractCegarLoop]: Abstraction has 702 states and 926 transitions. [2019-11-23 22:20:02,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 926 transitions. [2019-11-23 22:20:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:20:02,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:02,027 INFO L410 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-11-23 22:20:02,028 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash 694420866, now seen corresponding path program 1 times [2019-11-23 22:20:02,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:02,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066816637] [2019-11-23 22:20:02,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:02,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066816637] [2019-11-23 22:20:02,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:02,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:20:02,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842113709] [2019-11-23 22:20:02,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:20:02,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:02,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:20:02,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:02,099 INFO L87 Difference]: Start difference. First operand 702 states and 926 transitions. Second operand 9 states. [2019-11-23 22:20:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:02,790 INFO L93 Difference]: Finished difference Result 728 states and 949 transitions. [2019-11-23 22:20:02,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:02,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-23 22:20:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:02,794 INFO L225 Difference]: With dead ends: 728 [2019-11-23 22:20:02,795 INFO L226 Difference]: Without dead ends: 719 [2019-11-23 22:20:02,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:20:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-11-23 22:20:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 702. [2019-11-23 22:20:02,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-11-23 22:20:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 924 transitions. [2019-11-23 22:20:02,827 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 924 transitions. Word has length 31 [2019-11-23 22:20:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:02,828 INFO L462 AbstractCegarLoop]: Abstraction has 702 states and 924 transitions. [2019-11-23 22:20:02,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:20:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 924 transitions. [2019-11-23 22:20:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:20:02,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:02,829 INFO L410 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-11-23 22:20:02,829 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:02,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:02,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1700782205, now seen corresponding path program 1 times [2019-11-23 22:20:02,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:02,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227286153] [2019-11-23 22:20:02,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:02,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227286153] [2019-11-23 22:20:02,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:02,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:02,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855090614] [2019-11-23 22:20:02,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:02,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:02,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:02,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:02,865 INFO L87 Difference]: Start difference. First operand 702 states and 924 transitions. Second operand 3 states. [2019-11-23 22:20:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:03,019 INFO L93 Difference]: Finished difference Result 910 states and 1200 transitions. [2019-11-23 22:20:03,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:03,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:20:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:03,025 INFO L225 Difference]: With dead ends: 910 [2019-11-23 22:20:03,025 INFO L226 Difference]: Without dead ends: 704 [2019-11-23 22:20:03,026 INFO L630 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-11-23 22:20:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-11-23 22:20:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-11-23 22:20:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-11-23 22:20:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 927 transitions. [2019-11-23 22:20:03,058 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 927 transitions. Word has length 31 [2019-11-23 22:20:03,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:03,059 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 927 transitions. [2019-11-23 22:20:03,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 927 transitions. [2019-11-23 22:20:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:20:03,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:03,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:03,060 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1153413219, now seen corresponding path program 1 times [2019-11-23 22:20:03,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:03,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382159039] [2019-11-23 22:20:03,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:03,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382159039] [2019-11-23 22:20:03,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:03,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:03,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612904456] [2019-11-23 22:20:03,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:03,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:03,107 INFO L87 Difference]: Start difference. First operand 704 states and 927 transitions. Second operand 6 states. [2019-11-23 22:20:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:03,417 INFO L93 Difference]: Finished difference Result 764 states and 990 transitions. [2019-11-23 22:20:03,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:03,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-23 22:20:03,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:03,423 INFO L225 Difference]: With dead ends: 764 [2019-11-23 22:20:03,423 INFO L226 Difference]: Without dead ends: 761 [2019-11-23 22:20:03,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-11-23 22:20:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 717. [2019-11-23 22:20:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-11-23 22:20:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 943 transitions. [2019-11-23 22:20:03,458 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 943 transitions. Word has length 32 [2019-11-23 22:20:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:03,458 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 943 transitions. [2019-11-23 22:20:03,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 943 transitions. [2019-11-23 22:20:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:20:03,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:03,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:03,460 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:03,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:03,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1153425135, now seen corresponding path program 1 times [2019-11-23 22:20:03,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:03,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177225791] [2019-11-23 22:20:03,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:03,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177225791] [2019-11-23 22:20:03,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:03,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:03,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392480972] [2019-11-23 22:20:03,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:03,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:03,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:03,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:03,499 INFO L87 Difference]: Start difference. First operand 717 states and 943 transitions. Second operand 6 states. [2019-11-23 22:20:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:03,843 INFO L93 Difference]: Finished difference Result 1397 states and 1826 transitions. [2019-11-23 22:20:03,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:03,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-23 22:20:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:03,848 INFO L225 Difference]: With dead ends: 1397 [2019-11-23 22:20:03,848 INFO L226 Difference]: Without dead ends: 1103 [2019-11-23 22:20:03,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:20:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-11-23 22:20:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 768. [2019-11-23 22:20:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-11-23 22:20:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1014 transitions. [2019-11-23 22:20:03,899 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1014 transitions. Word has length 32 [2019-11-23 22:20:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:03,900 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1014 transitions. [2019-11-23 22:20:03,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1014 transitions. [2019-11-23 22:20:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:20:03,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:03,901 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:03,901 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:03,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:03,902 INFO L82 PathProgramCache]: Analyzing trace with hash -311747134, now seen corresponding path program 1 times [2019-11-23 22:20:03,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:03,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337415903] [2019-11-23 22:20:03,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:03,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337415903] [2019-11-23 22:20:03,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:03,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:03,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571887038] [2019-11-23 22:20:03,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:03,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:03,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:03,964 INFO L87 Difference]: Start difference. First operand 768 states and 1014 transitions. Second operand 6 states. [2019-11-23 22:20:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:04,057 INFO L93 Difference]: Finished difference Result 781 states and 1026 transitions. [2019-11-23 22:20:04,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:20:04,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-23 22:20:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:04,061 INFO L225 Difference]: With dead ends: 781 [2019-11-23 22:20:04,061 INFO L226 Difference]: Without dead ends: 760 [2019-11-23 22:20:04,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-11-23 22:20:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2019-11-23 22:20:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-11-23 22:20:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1003 transitions. [2019-11-23 22:20:04,099 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1003 transitions. Word has length 32 [2019-11-23 22:20:04,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:04,100 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1003 transitions. [2019-11-23 22:20:04,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1003 transitions. [2019-11-23 22:20:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:20:04,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:04,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:04,101 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:04,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:04,102 INFO L82 PathProgramCache]: Analyzing trace with hash -909472821, now seen corresponding path program 1 times [2019-11-23 22:20:04,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:04,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880456036] [2019-11-23 22:20:04,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:04,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880456036] [2019-11-23 22:20:04,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:04,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:04,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300365302] [2019-11-23 22:20:04,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:04,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:04,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:04,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:04,130 INFO L87 Difference]: Start difference. First operand 760 states and 1003 transitions. Second operand 3 states. [2019-11-23 22:20:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:04,182 INFO L93 Difference]: Finished difference Result 943 states and 1238 transitions. [2019-11-23 22:20:04,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:04,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:20:04,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:04,186 INFO L225 Difference]: With dead ends: 943 [2019-11-23 22:20:04,186 INFO L226 Difference]: Without dead ends: 736 [2019-11-23 22:20:04,187 INFO L630 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-11-23 22:20:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-23 22:20:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 720. [2019-11-23 22:20:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-23 22:20:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 945 transitions. [2019-11-23 22:20:04,241 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 945 transitions. Word has length 32 [2019-11-23 22:20:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:04,242 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 945 transitions. [2019-11-23 22:20:04,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 945 transitions. [2019-11-23 22:20:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:20:04,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:04,243 INFO L410 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-11-23 22:20:04,244 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:04,244 INFO L82 PathProgramCache]: Analyzing trace with hash -353842307, now seen corresponding path program 1 times [2019-11-23 22:20:04,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:04,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412249904] [2019-11-23 22:20:04,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:04,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412249904] [2019-11-23 22:20:04,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:04,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:04,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354600153] [2019-11-23 22:20:04,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:04,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:04,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:04,309 INFO L87 Difference]: Start difference. First operand 720 states and 945 transitions. Second operand 5 states. [2019-11-23 22:20:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:04,406 INFO L93 Difference]: Finished difference Result 853 states and 1095 transitions. [2019-11-23 22:20:04,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:04,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-23 22:20:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:04,411 INFO L225 Difference]: With dead ends: 853 [2019-11-23 22:20:04,412 INFO L226 Difference]: Without dead ends: 832 [2019-11-23 22:20:04,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:20:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-11-23 22:20:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 723. [2019-11-23 22:20:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-23 22:20:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 948 transitions. [2019-11-23 22:20:04,457 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 948 transitions. Word has length 33 [2019-11-23 22:20:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:04,457 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 948 transitions. [2019-11-23 22:20:04,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 948 transitions. [2019-11-23 22:20:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:20:04,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:04,459 INFO L410 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-11-23 22:20:04,459 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:04,460 INFO L82 PathProgramCache]: Analyzing trace with hash -56726392, now seen corresponding path program 1 times [2019-11-23 22:20:04,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:04,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228677144] [2019-11-23 22:20:04,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:04,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:04,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228677144] [2019-11-23 22:20:04,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:04,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:04,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701567270] [2019-11-23 22:20:04,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:04,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:04,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:04,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:04,504 INFO L87 Difference]: Start difference. First operand 723 states and 948 transitions. Second operand 3 states. [2019-11-23 22:20:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:04,675 INFO L93 Difference]: Finished difference Result 874 states and 1127 transitions. [2019-11-23 22:20:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:04,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:20:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:04,679 INFO L225 Difference]: With dead ends: 874 [2019-11-23 22:20:04,679 INFO L226 Difference]: Without dead ends: 839 [2019-11-23 22:20:04,679 INFO L630 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-11-23 22:20:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-11-23 22:20:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 776. [2019-11-23 22:20:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-23 22:20:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1005 transitions. [2019-11-23 22:20:04,711 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1005 transitions. Word has length 33 [2019-11-23 22:20:04,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:04,712 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1005 transitions. [2019-11-23 22:20:04,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1005 transitions. [2019-11-23 22:20:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:20:04,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:04,713 INFO L410 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-11-23 22:20:04,713 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:04,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:04,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1516001350, now seen corresponding path program 1 times [2019-11-23 22:20:04,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:04,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96412903] [2019-11-23 22:20:04,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:04,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96412903] [2019-11-23 22:20:04,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:04,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:04,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347963671] [2019-11-23 22:20:04,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:04,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:04,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:04,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:04,752 INFO L87 Difference]: Start difference. First operand 776 states and 1005 transitions. Second operand 4 states. [2019-11-23 22:20:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:04,926 INFO L93 Difference]: Finished difference Result 799 states and 1028 transitions. [2019-11-23 22:20:04,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:04,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-23 22:20:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:04,930 INFO L225 Difference]: With dead ends: 799 [2019-11-23 22:20:04,930 INFO L226 Difference]: Without dead ends: 688 [2019-11-23 22:20:04,931 INFO L630 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-11-23 22:20:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-11-23 22:20:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 674. [2019-11-23 22:20:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-23 22:20:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 860 transitions. [2019-11-23 22:20:04,971 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 860 transitions. Word has length 33 [2019-11-23 22:20:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:04,971 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 860 transitions. [2019-11-23 22:20:04,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 860 transitions. [2019-11-23 22:20:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:20:04,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:04,973 INFO L410 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-11-23 22:20:04,973 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1819476696, now seen corresponding path program 1 times [2019-11-23 22:20:04,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:04,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265595073] [2019-11-23 22:20:04,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:05,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265595073] [2019-11-23 22:20:05,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:05,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:20:05,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791363846] [2019-11-23 22:20:05,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:20:05,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:05,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:20:05,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:20:05,060 INFO L87 Difference]: Start difference. First operand 674 states and 860 transitions. Second operand 10 states. [2019-11-23 22:20:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:06,299 INFO L93 Difference]: Finished difference Result 776 states and 977 transitions. [2019-11-23 22:20:06,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:20:06,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-11-23 22:20:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:06,303 INFO L225 Difference]: With dead ends: 776 [2019-11-23 22:20:06,303 INFO L226 Difference]: Without dead ends: 760 [2019-11-23 22:20:06,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:20:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-11-23 22:20:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 676. [2019-11-23 22:20:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-11-23 22:20:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 862 transitions. [2019-11-23 22:20:06,353 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 862 transitions. Word has length 33 [2019-11-23 22:20:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:06,354 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 862 transitions. [2019-11-23 22:20:06,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:20:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 862 transitions. [2019-11-23 22:20:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:20:06,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:06,355 INFO L410 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-11-23 22:20:06,355 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:06,356 INFO L82 PathProgramCache]: Analyzing trace with hash -471504232, now seen corresponding path program 1 times [2019-11-23 22:20:06,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:06,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221713018] [2019-11-23 22:20:06,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:06,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221713018] [2019-11-23 22:20:06,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:06,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:06,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301398545] [2019-11-23 22:20:06,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:06,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:06,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:06,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:06,438 INFO L87 Difference]: Start difference. First operand 676 states and 862 transitions. Second operand 5 states. [2019-11-23 22:20:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:06,717 INFO L93 Difference]: Finished difference Result 690 states and 874 transitions. [2019-11-23 22:20:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:06,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-23 22:20:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:06,720 INFO L225 Difference]: With dead ends: 690 [2019-11-23 22:20:06,720 INFO L226 Difference]: Without dead ends: 674 [2019-11-23 22:20:06,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-11-23 22:20:06,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 665. [2019-11-23 22:20:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-11-23 22:20:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 848 transitions. [2019-11-23 22:20:06,760 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 848 transitions. Word has length 33 [2019-11-23 22:20:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:06,760 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 848 transitions. [2019-11-23 22:20:06,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 848 transitions. [2019-11-23 22:20:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:20:06,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:06,762 INFO L410 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-11-23 22:20:06,762 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:06,763 INFO L82 PathProgramCache]: Analyzing trace with hash -935530627, now seen corresponding path program 1 times [2019-11-23 22:20:06,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:06,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578370087] [2019-11-23 22:20:06,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:06,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578370087] [2019-11-23 22:20:06,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:06,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:20:06,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111932632] [2019-11-23 22:20:06,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:20:06,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:06,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:20:06,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:06,847 INFO L87 Difference]: Start difference. First operand 665 states and 848 transitions. Second operand 9 states. [2019-11-23 22:20:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:07,974 INFO L93 Difference]: Finished difference Result 1076 states and 1357 transitions. [2019-11-23 22:20:07,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:20:07,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-23 22:20:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:07,979 INFO L225 Difference]: With dead ends: 1076 [2019-11-23 22:20:07,979 INFO L226 Difference]: Without dead ends: 1053 [2019-11-23 22:20:07,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:20:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-11-23 22:20:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 663. [2019-11-23 22:20:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-11-23 22:20:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 844 transitions. [2019-11-23 22:20:08,026 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 844 transitions. Word has length 35 [2019-11-23 22:20:08,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:08,026 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 844 transitions. [2019-11-23 22:20:08,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:20:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 844 transitions. [2019-11-23 22:20:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:20:08,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:08,028 INFO L410 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-11-23 22:20:08,028 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:08,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:08,029 INFO L82 PathProgramCache]: Analyzing trace with hash 750020413, now seen corresponding path program 1 times [2019-11-23 22:20:08,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:08,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635947405] [2019-11-23 22:20:08,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:08,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635947405] [2019-11-23 22:20:08,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:08,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:08,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23573512] [2019-11-23 22:20:08,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:08,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:08,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:08,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:08,065 INFO L87 Difference]: Start difference. First operand 663 states and 844 transitions. Second operand 4 states. [2019-11-23 22:20:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:08,220 INFO L93 Difference]: Finished difference Result 728 states and 926 transitions. [2019-11-23 22:20:08,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:08,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-23 22:20:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:08,223 INFO L225 Difference]: With dead ends: 728 [2019-11-23 22:20:08,223 INFO L226 Difference]: Without dead ends: 691 [2019-11-23 22:20:08,224 INFO L630 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-11-23 22:20:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-11-23 22:20:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 631. [2019-11-23 22:20:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-11-23 22:20:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 808 transitions. [2019-11-23 22:20:08,268 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 808 transitions. Word has length 35 [2019-11-23 22:20:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:08,268 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 808 transitions. [2019-11-23 22:20:08,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 808 transitions. [2019-11-23 22:20:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:20:08,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:08,269 INFO L410 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-11-23 22:20:08,269 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1333490113, now seen corresponding path program 1 times [2019-11-23 22:20:08,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:08,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109485544] [2019-11-23 22:20:08,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:08,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109485544] [2019-11-23 22:20:08,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:08,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:08,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164599199] [2019-11-23 22:20:08,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:08,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:08,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:08,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:08,312 INFO L87 Difference]: Start difference. First operand 631 states and 808 transitions. Second operand 5 states. [2019-11-23 22:20:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:08,546 INFO L93 Difference]: Finished difference Result 1371 states and 1763 transitions. [2019-11-23 22:20:08,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:08,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-23 22:20:08,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:08,550 INFO L225 Difference]: With dead ends: 1371 [2019-11-23 22:20:08,550 INFO L226 Difference]: Without dead ends: 1185 [2019-11-23 22:20:08,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:20:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-11-23 22:20:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 638. [2019-11-23 22:20:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-23 22:20:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 815 transitions. [2019-11-23 22:20:08,589 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 815 transitions. Word has length 35 [2019-11-23 22:20:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:08,589 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 815 transitions. [2019-11-23 22:20:08,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 815 transitions. [2019-11-23 22:20:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:20:08,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:08,591 INFO L410 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] [2019-11-23 22:20:08,591 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:08,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:08,591 INFO L82 PathProgramCache]: Analyzing trace with hash -901089383, now seen corresponding path program 1 times [2019-11-23 22:20:08,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:08,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795361961] [2019-11-23 22:20:08,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:08,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:08,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795361961] [2019-11-23 22:20:08,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:08,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:08,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743142709] [2019-11-23 22:20:08,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:08,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:08,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:08,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:08,635 INFO L87 Difference]: Start difference. First operand 638 states and 815 transitions. Second operand 3 states. [2019-11-23 22:20:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:08,707 INFO L93 Difference]: Finished difference Result 898 states and 1150 transitions. [2019-11-23 22:20:08,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:08,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-23 22:20:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:08,710 INFO L225 Difference]: With dead ends: 898 [2019-11-23 22:20:08,710 INFO L226 Difference]: Without dead ends: 699 [2019-11-23 22:20:08,711 INFO L630 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-11-23 22:20:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-11-23 22:20:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 626. [2019-11-23 22:20:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-23 22:20:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 797 transitions. [2019-11-23 22:20:08,781 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 797 transitions. Word has length 36 [2019-11-23 22:20:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:08,782 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 797 transitions. [2019-11-23 22:20:08,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 797 transitions. [2019-11-23 22:20:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:20:08,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:08,783 INFO L410 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] [2019-11-23 22:20:08,784 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash -307255467, now seen corresponding path program 1 times [2019-11-23 22:20:08,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:08,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349346756] [2019-11-23 22:20:08,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:08,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349346756] [2019-11-23 22:20:08,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:08,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:08,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85511045] [2019-11-23 22:20:08,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:08,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:08,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:08,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:08,845 INFO L87 Difference]: Start difference. First operand 626 states and 797 transitions. Second operand 6 states. [2019-11-23 22:20:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:09,043 INFO L93 Difference]: Finished difference Result 725 states and 904 transitions. [2019-11-23 22:20:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:20:09,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-23 22:20:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:09,058 INFO L225 Difference]: With dead ends: 725 [2019-11-23 22:20:09,058 INFO L226 Difference]: Without dead ends: 688 [2019-11-23 22:20:09,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:20:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-11-23 22:20:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 619. [2019-11-23 22:20:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-11-23 22:20:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 787 transitions. [2019-11-23 22:20:09,113 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 787 transitions. Word has length 37 [2019-11-23 22:20:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:09,114 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 787 transitions. [2019-11-23 22:20:09,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 787 transitions. [2019-11-23 22:20:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:20:09,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:09,115 INFO L410 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] [2019-11-23 22:20:09,115 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1515937655, now seen corresponding path program 1 times [2019-11-23 22:20:09,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:09,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966819765] [2019-11-23 22:20:09,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:09,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966819765] [2019-11-23 22:20:09,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:09,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:09,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014721784] [2019-11-23 22:20:09,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:09,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:09,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:09,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:09,157 INFO L87 Difference]: Start difference. First operand 619 states and 787 transitions. Second operand 5 states. [2019-11-23 22:20:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:09,245 INFO L93 Difference]: Finished difference Result 648 states and 815 transitions. [2019-11-23 22:20:09,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:09,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-23 22:20:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:09,247 INFO L225 Difference]: With dead ends: 648 [2019-11-23 22:20:09,247 INFO L226 Difference]: Without dead ends: 631 [2019-11-23 22:20:09,248 INFO L630 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-11-23 22:20:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-11-23 22:20:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 618. [2019-11-23 22:20:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-11-23 22:20:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 785 transitions. [2019-11-23 22:20:09,280 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 785 transitions. Word has length 37 [2019-11-23 22:20:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:09,280 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 785 transitions. [2019-11-23 22:20:09,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 785 transitions. [2019-11-23 22:20:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:20:09,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:09,282 INFO L410 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] [2019-11-23 22:20:09,282 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:09,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:09,283 INFO L82 PathProgramCache]: Analyzing trace with hash -604679938, now seen corresponding path program 1 times [2019-11-23 22:20:09,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:09,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216838126] [2019-11-23 22:20:09,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:09,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216838126] [2019-11-23 22:20:09,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:09,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:09,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435525341] [2019-11-23 22:20:09,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:09,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:09,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:09,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:09,330 INFO L87 Difference]: Start difference. First operand 618 states and 785 transitions. Second operand 6 states. [2019-11-23 22:20:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:09,558 INFO L93 Difference]: Finished difference Result 657 states and 821 transitions. [2019-11-23 22:20:09,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:09,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-23 22:20:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:09,559 INFO L225 Difference]: With dead ends: 657 [2019-11-23 22:20:09,559 INFO L226 Difference]: Without dead ends: 623 [2019-11-23 22:20:09,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-11-23 22:20:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 602. [2019-11-23 22:20:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-11-23 22:20:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 765 transitions. [2019-11-23 22:20:09,593 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 765 transitions. Word has length 37 [2019-11-23 22:20:09,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:09,593 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 765 transitions. [2019-11-23 22:20:09,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 765 transitions. [2019-11-23 22:20:09,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:20:09,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:09,595 INFO L410 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] [2019-11-23 22:20:09,595 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash 48742328, now seen corresponding path program 1 times [2019-11-23 22:20:09,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:09,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139137434] [2019-11-23 22:20:09,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:09,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139137434] [2019-11-23 22:20:09,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:09,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:09,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074341915] [2019-11-23 22:20:09,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:09,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:09,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:09,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:09,711 INFO L87 Difference]: Start difference. First operand 602 states and 765 transitions. Second operand 4 states. [2019-11-23 22:20:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:09,854 INFO L93 Difference]: Finished difference Result 798 states and 1014 transitions. [2019-11-23 22:20:09,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:09,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-23 22:20:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:09,856 INFO L225 Difference]: With dead ends: 798 [2019-11-23 22:20:09,856 INFO L226 Difference]: Without dead ends: 579 [2019-11-23 22:20:09,857 INFO L630 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-11-23 22:20:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-11-23 22:20:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 567. [2019-11-23 22:20:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-11-23 22:20:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 714 transitions. [2019-11-23 22:20:09,924 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 714 transitions. Word has length 37 [2019-11-23 22:20:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:09,925 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 714 transitions. [2019-11-23 22:20:09,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 714 transitions. [2019-11-23 22:20:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:20:09,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:09,926 INFO L410 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] [2019-11-23 22:20:09,927 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:09,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:09,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1967560492, now seen corresponding path program 1 times [2019-11-23 22:20:09,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:09,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188957249] [2019-11-23 22:20:09,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:09,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188957249] [2019-11-23 22:20:09,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:09,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:09,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022431298] [2019-11-23 22:20:09,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:09,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:09,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:09,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:09,978 INFO L87 Difference]: Start difference. First operand 567 states and 714 transitions. Second operand 4 states. [2019-11-23 22:20:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:10,189 INFO L93 Difference]: Finished difference Result 748 states and 947 transitions. [2019-11-23 22:20:10,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:10,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-23 22:20:10,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:10,191 INFO L225 Difference]: With dead ends: 748 [2019-11-23 22:20:10,191 INFO L226 Difference]: Without dead ends: 564 [2019-11-23 22:20:10,192 INFO L630 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-11-23 22:20:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-11-23 22:20:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-11-23 22:20:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-11-23 22:20:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 705 transitions. [2019-11-23 22:20:10,276 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 705 transitions. Word has length 38 [2019-11-23 22:20:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:10,276 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 705 transitions. [2019-11-23 22:20:10,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 705 transitions. [2019-11-23 22:20:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:20:10,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:10,279 INFO L410 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] [2019-11-23 22:20:10,280 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:10,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:10,280 INFO L82 PathProgramCache]: Analyzing trace with hash -436735014, now seen corresponding path program 1 times [2019-11-23 22:20:10,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:10,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638953834] [2019-11-23 22:20:10,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:10,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638953834] [2019-11-23 22:20:10,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:10,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:10,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710835637] [2019-11-23 22:20:10,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:10,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:10,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:10,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:10,375 INFO L87 Difference]: Start difference. First operand 564 states and 705 transitions. Second operand 5 states. [2019-11-23 22:20:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:10,516 INFO L93 Difference]: Finished difference Result 587 states and 725 transitions. [2019-11-23 22:20:10,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:20:10,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-23 22:20:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:10,518 INFO L225 Difference]: With dead ends: 587 [2019-11-23 22:20:10,518 INFO L226 Difference]: Without dead ends: 566 [2019-11-23 22:20:10,519 INFO L630 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-11-23 22:20:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-23 22:20:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 556. [2019-11-23 22:20:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-23 22:20:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 695 transitions. [2019-11-23 22:20:10,599 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 695 transitions. Word has length 41 [2019-11-23 22:20:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:10,600 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 695 transitions. [2019-11-23 22:20:10,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 695 transitions. [2019-11-23 22:20:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:20:10,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:10,601 INFO L410 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] [2019-11-23 22:20:10,601 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:10,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:10,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1643790660, now seen corresponding path program 1 times [2019-11-23 22:20:10,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:10,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959565692] [2019-11-23 22:20:10,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:10,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:10,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959565692] [2019-11-23 22:20:10,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:10,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:10,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279315964] [2019-11-23 22:20:10,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:10,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:10,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:10,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:10,650 INFO L87 Difference]: Start difference. First operand 556 states and 695 transitions. Second operand 4 states. [2019-11-23 22:20:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:10,747 INFO L93 Difference]: Finished difference Result 584 states and 724 transitions. [2019-11-23 22:20:10,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:10,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-23 22:20:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:10,749 INFO L225 Difference]: With dead ends: 584 [2019-11-23 22:20:10,749 INFO L226 Difference]: Without dead ends: 566 [2019-11-23 22:20:10,749 INFO L630 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-11-23 22:20:10,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-23 22:20:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 542. [2019-11-23 22:20:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-23 22:20:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 679 transitions. [2019-11-23 22:20:10,812 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 679 transitions. Word has length 41 [2019-11-23 22:20:10,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:10,812 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 679 transitions. [2019-11-23 22:20:10,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 679 transitions. [2019-11-23 22:20:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:20:10,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:10,813 INFO L410 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] [2019-11-23 22:20:10,814 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:10,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:10,814 INFO L82 PathProgramCache]: Analyzing trace with hash -147578755, now seen corresponding path program 1 times [2019-11-23 22:20:10,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:10,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932627808] [2019-11-23 22:20:10,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:10,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932627808] [2019-11-23 22:20:10,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:10,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:10,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78959919] [2019-11-23 22:20:10,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:10,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:10,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:10,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:10,840 INFO L87 Difference]: Start difference. First operand 542 states and 679 transitions. Second operand 3 states. [2019-11-23 22:20:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:11,003 INFO L93 Difference]: Finished difference Result 937 states and 1169 transitions. [2019-11-23 22:20:11,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:11,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-23 22:20:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:11,005 INFO L225 Difference]: With dead ends: 937 [2019-11-23 22:20:11,005 INFO L226 Difference]: Without dead ends: 756 [2019-11-23 22:20:11,006 INFO L630 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-11-23 22:20:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-11-23 22:20:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 545. [2019-11-23 22:20:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-11-23 22:20:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 682 transitions. [2019-11-23 22:20:11,061 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 682 transitions. Word has length 41 [2019-11-23 22:20:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:11,062 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 682 transitions. [2019-11-23 22:20:11,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:11,062 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 682 transitions. [2019-11-23 22:20:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:20:11,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:11,063 INFO L410 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] [2019-11-23 22:20:11,063 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:11,064 INFO L82 PathProgramCache]: Analyzing trace with hash 160458813, now seen corresponding path program 1 times [2019-11-23 22:20:11,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:11,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553659343] [2019-11-23 22:20:11,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:11,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553659343] [2019-11-23 22:20:11,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:11,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:11,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548778707] [2019-11-23 22:20:11,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:11,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:11,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:11,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:11,118 INFO L87 Difference]: Start difference. First operand 545 states and 682 transitions. Second operand 5 states. [2019-11-23 22:20:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:11,367 INFO L93 Difference]: Finished difference Result 922 states and 1139 transitions. [2019-11-23 22:20:11,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:20:11,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-23 22:20:11,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:11,369 INFO L225 Difference]: With dead ends: 922 [2019-11-23 22:20:11,369 INFO L226 Difference]: Without dead ends: 766 [2019-11-23 22:20:11,370 INFO L630 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-11-23 22:20:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-11-23 22:20:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 545. [2019-11-23 22:20:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-11-23 22:20:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 678 transitions. [2019-11-23 22:20:11,446 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 678 transitions. Word has length 41 [2019-11-23 22:20:11,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:11,446 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 678 transitions. [2019-11-23 22:20:11,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 678 transitions. [2019-11-23 22:20:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 22:20:11,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:11,448 INFO L410 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] [2019-11-23 22:20:11,449 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:11,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:11,449 INFO L82 PathProgramCache]: Analyzing trace with hash -693628121, now seen corresponding path program 1 times [2019-11-23 22:20:11,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:11,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220315862] [2019-11-23 22:20:11,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:11,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220315862] [2019-11-23 22:20:11,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:11,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:11,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021780541] [2019-11-23 22:20:11,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:11,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:11,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:11,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:11,514 INFO L87 Difference]: Start difference. First operand 545 states and 678 transitions. Second operand 4 states. [2019-11-23 22:20:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:11,632 INFO L93 Difference]: Finished difference Result 794 states and 966 transitions. [2019-11-23 22:20:11,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:11,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-23 22:20:11,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:11,634 INFO L225 Difference]: With dead ends: 794 [2019-11-23 22:20:11,634 INFO L226 Difference]: Without dead ends: 707 [2019-11-23 22:20:11,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-11-23 22:20:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 549. [2019-11-23 22:20:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-11-23 22:20:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 682 transitions. [2019-11-23 22:20:11,728 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 682 transitions. Word has length 42 [2019-11-23 22:20:11,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:11,728 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 682 transitions. [2019-11-23 22:20:11,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 682 transitions. [2019-11-23 22:20:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 22:20:11,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:11,730 INFO L410 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] [2019-11-23 22:20:11,730 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:11,731 INFO L82 PathProgramCache]: Analyzing trace with hash -81749273, now seen corresponding path program 1 times [2019-11-23 22:20:11,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:11,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056484987] [2019-11-23 22:20:11,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:11,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056484987] [2019-11-23 22:20:11,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:11,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:11,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184057526] [2019-11-23 22:20:11,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:11,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:11,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:11,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:11,791 INFO L87 Difference]: Start difference. First operand 549 states and 682 transitions. Second operand 7 states. [2019-11-23 22:20:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:11,956 INFO L93 Difference]: Finished difference Result 777 states and 942 transitions. [2019-11-23 22:20:11,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:11,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-23 22:20:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:11,958 INFO L225 Difference]: With dead ends: 777 [2019-11-23 22:20:11,958 INFO L226 Difference]: Without dead ends: 619 [2019-11-23 22:20:11,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:20:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-11-23 22:20:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 552. [2019-11-23 22:20:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-11-23 22:20:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 683 transitions. [2019-11-23 22:20:12,012 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 683 transitions. Word has length 42 [2019-11-23 22:20:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:12,014 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 683 transitions. [2019-11-23 22:20:12,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 683 transitions. [2019-11-23 22:20:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 22:20:12,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:12,016 INFO L410 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] [2019-11-23 22:20:12,017 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -822982435, now seen corresponding path program 1 times [2019-11-23 22:20:12,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:12,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823829136] [2019-11-23 22:20:12,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:12,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823829136] [2019-11-23 22:20:12,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:12,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:12,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641664224] [2019-11-23 22:20:12,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:12,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:12,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:12,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:12,064 INFO L87 Difference]: Start difference. First operand 552 states and 683 transitions. Second operand 7 states. [2019-11-23 22:20:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:12,444 INFO L93 Difference]: Finished difference Result 587 states and 716 transitions. [2019-11-23 22:20:12,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:12,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-23 22:20:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:12,446 INFO L225 Difference]: With dead ends: 587 [2019-11-23 22:20:12,446 INFO L226 Difference]: Without dead ends: 440 [2019-11-23 22:20:12,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:20:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-23 22:20:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 410. [2019-11-23 22:20:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-23 22:20:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 504 transitions. [2019-11-23 22:20:12,490 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 504 transitions. Word has length 42 [2019-11-23 22:20:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:12,490 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 504 transitions. [2019-11-23 22:20:12,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 504 transitions. [2019-11-23 22:20:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 22:20:12,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:12,491 INFO L410 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-11-23 22:20:12,492 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1536215993, now seen corresponding path program 1 times [2019-11-23 22:20:12,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:12,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498804299] [2019-11-23 22:20:12,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:12,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498804299] [2019-11-23 22:20:12,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:12,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:12,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286282550] [2019-11-23 22:20:12,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:12,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:12,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:12,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:12,557 INFO L87 Difference]: Start difference. First operand 410 states and 504 transitions. Second operand 5 states. [2019-11-23 22:20:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:12,769 INFO L93 Difference]: Finished difference Result 828 states and 1031 transitions. [2019-11-23 22:20:12,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:12,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-23 22:20:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:12,771 INFO L225 Difference]: With dead ends: 828 [2019-11-23 22:20:12,771 INFO L226 Difference]: Without dead ends: 698 [2019-11-23 22:20:12,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:20:12,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-11-23 22:20:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 410. [2019-11-23 22:20:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-23 22:20:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 503 transitions. [2019-11-23 22:20:12,817 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 503 transitions. Word has length 44 [2019-11-23 22:20:12,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:12,817 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 503 transitions. [2019-11-23 22:20:12,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 503 transitions. [2019-11-23 22:20:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-23 22:20:12,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:12,819 INFO L410 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, 1, 1] [2019-11-23 22:20:12,819 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:12,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1966977471, now seen corresponding path program 1 times [2019-11-23 22:20:12,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:12,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531790150] [2019-11-23 22:20:12,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:12,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531790150] [2019-11-23 22:20:12,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:12,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:20:12,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146293276] [2019-11-23 22:20:12,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:20:12,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:20:12,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:20:12,885 INFO L87 Difference]: Start difference. First operand 410 states and 503 transitions. Second operand 8 states. [2019-11-23 22:20:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:13,062 INFO L93 Difference]: Finished difference Result 425 states and 517 transitions. [2019-11-23 22:20:13,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:13,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-23 22:20:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:13,064 INFO L225 Difference]: With dead ends: 425 [2019-11-23 22:20:13,064 INFO L226 Difference]: Without dead ends: 402 [2019-11-23 22:20:13,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:20:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-11-23 22:20:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2019-11-23 22:20:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-11-23 22:20:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 493 transitions. [2019-11-23 22:20:13,120 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 493 transitions. Word has length 46 [2019-11-23 22:20:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:13,120 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 493 transitions. [2019-11-23 22:20:13,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:20:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 493 transitions. [2019-11-23 22:20:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 22:20:13,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:13,121 INFO L410 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, 1, 1, 1] [2019-11-23 22:20:13,122 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:13,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:13,123 INFO L82 PathProgramCache]: Analyzing trace with hash -702658274, now seen corresponding path program 1 times [2019-11-23 22:20:13,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:13,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283239786] [2019-11-23 22:20:13,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:13,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283239786] [2019-11-23 22:20:13,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:13,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:13,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089586352] [2019-11-23 22:20:13,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:13,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:13,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:13,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:13,163 INFO L87 Difference]: Start difference. First operand 402 states and 493 transitions. Second operand 4 states. [2019-11-23 22:20:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:13,258 INFO L93 Difference]: Finished difference Result 507 states and 610 transitions. [2019-11-23 22:20:13,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:13,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-23 22:20:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:13,260 INFO L225 Difference]: With dead ends: 507 [2019-11-23 22:20:13,260 INFO L226 Difference]: Without dead ends: 464 [2019-11-23 22:20:13,260 INFO L630 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-11-23 22:20:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-23 22:20:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 401. [2019-11-23 22:20:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-11-23 22:20:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 491 transitions. [2019-11-23 22:20:13,330 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 491 transitions. Word has length 47 [2019-11-23 22:20:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:13,331 INFO L462 AbstractCegarLoop]: Abstraction has 401 states and 491 transitions. [2019-11-23 22:20:13,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 491 transitions. [2019-11-23 22:20:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 22:20:13,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:13,332 INFO L410 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, 1, 1, 1] [2019-11-23 22:20:13,332 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:13,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:13,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1085716830, now seen corresponding path program 1 times [2019-11-23 22:20:13,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:13,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998788355] [2019-11-23 22:20:13,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:13,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998788355] [2019-11-23 22:20:13,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:13,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:13,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627712345] [2019-11-23 22:20:13,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:13,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:13,379 INFO L87 Difference]: Start difference. First operand 401 states and 491 transitions. Second operand 7 states. [2019-11-23 22:20:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:13,503 INFO L93 Difference]: Finished difference Result 481 states and 578 transitions. [2019-11-23 22:20:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:13,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-23 22:20:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:13,504 INFO L225 Difference]: With dead ends: 481 [2019-11-23 22:20:13,505 INFO L226 Difference]: Without dead ends: 394 [2019-11-23 22:20:13,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:20:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-11-23 22:20:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 382. [2019-11-23 22:20:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-23 22:20:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 468 transitions. [2019-11-23 22:20:13,561 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 468 transitions. Word has length 47 [2019-11-23 22:20:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:13,562 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 468 transitions. [2019-11-23 22:20:13,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 468 transitions. [2019-11-23 22:20:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-23 22:20:13,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:13,565 INFO L410 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, 1, 1, 1, 1] [2019-11-23 22:20:13,566 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:13,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1259536918, now seen corresponding path program 1 times [2019-11-23 22:20:13,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:13,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315297746] [2019-11-23 22:20:13,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:13,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315297746] [2019-11-23 22:20:13,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:13,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:13,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743365723] [2019-11-23 22:20:13,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:13,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:13,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:13,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:13,612 INFO L87 Difference]: Start difference. First operand 382 states and 468 transitions. Second operand 3 states. [2019-11-23 22:20:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:13,730 INFO L93 Difference]: Finished difference Result 515 states and 638 transitions. [2019-11-23 22:20:13,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:13,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-23 22:20:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:13,732 INFO L225 Difference]: With dead ends: 515 [2019-11-23 22:20:13,732 INFO L226 Difference]: Without dead ends: 344 [2019-11-23 22:20:13,732 INFO L630 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-11-23 22:20:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-23 22:20:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-11-23 22:20:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-23 22:20:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 419 transitions. [2019-11-23 22:20:13,770 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 419 transitions. Word has length 48 [2019-11-23 22:20:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:13,770 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 419 transitions. [2019-11-23 22:20:13,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 419 transitions. [2019-11-23 22:20:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:20:13,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:13,771 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:13,772 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:13,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1390297930, now seen corresponding path program 1 times [2019-11-23 22:20:13,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:13,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858180568] [2019-11-23 22:20:13,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:13,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858180568] [2019-11-23 22:20:13,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:13,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:20:13,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633249151] [2019-11-23 22:20:13,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:20:13,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:13,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:20:13,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:20:13,836 INFO L87 Difference]: Start difference. First operand 344 states and 419 transitions. Second operand 8 states. [2019-11-23 22:20:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:14,016 INFO L93 Difference]: Finished difference Result 356 states and 430 transitions. [2019-11-23 22:20:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:14,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-23 22:20:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:14,018 INFO L225 Difference]: With dead ends: 356 [2019-11-23 22:20:14,019 INFO L226 Difference]: Without dead ends: 298 [2019-11-23 22:20:14,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:20:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-23 22:20:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-11-23 22:20:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:20:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2019-11-23 22:20:14,070 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 51 [2019-11-23 22:20:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:14,070 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2019-11-23 22:20:14,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:20:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2019-11-23 22:20:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:20:14,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:14,072 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:14,072 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:14,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:14,072 INFO L82 PathProgramCache]: Analyzing trace with hash -624384568, now seen corresponding path program 1 times [2019-11-23 22:20:14,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:14,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999482841] [2019-11-23 22:20:14,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:14,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999482841] [2019-11-23 22:20:14,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:14,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:14,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059784087] [2019-11-23 22:20:14,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:14,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:14,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:14,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:14,141 INFO L87 Difference]: Start difference. First operand 298 states and 361 transitions. Second operand 7 states. [2019-11-23 22:20:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:14,386 INFO L93 Difference]: Finished difference Result 422 states and 506 transitions. [2019-11-23 22:20:14,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:20:14,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-23 22:20:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:14,388 INFO L225 Difference]: With dead ends: 422 [2019-11-23 22:20:14,388 INFO L226 Difference]: Without dead ends: 404 [2019-11-23 22:20:14,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:20:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-11-23 22:20:14,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 298. [2019-11-23 22:20:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:20:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 360 transitions. [2019-11-23 22:20:14,424 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 360 transitions. Word has length 54 [2019-11-23 22:20:14,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:14,424 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 360 transitions. [2019-11-23 22:20:14,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 360 transitions. [2019-11-23 22:20:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:20:14,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:14,425 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:14,426 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:14,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:14,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1057733436, now seen corresponding path program 1 times [2019-11-23 22:20:14,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:14,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054115505] [2019-11-23 22:20:14,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:14,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054115505] [2019-11-23 22:20:14,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:14,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:14,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442767003] [2019-11-23 22:20:14,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:14,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:14,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:14,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:14,459 INFO L87 Difference]: Start difference. First operand 298 states and 360 transitions. Second operand 3 states. [2019-11-23 22:20:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:14,524 INFO L93 Difference]: Finished difference Result 535 states and 654 transitions. [2019-11-23 22:20:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:14,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-23 22:20:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:14,526 INFO L225 Difference]: With dead ends: 535 [2019-11-23 22:20:14,526 INFO L226 Difference]: Without dead ends: 352 [2019-11-23 22:20:14,527 INFO L630 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-11-23 22:20:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-23 22:20:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 298. [2019-11-23 22:20:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:20:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 357 transitions. [2019-11-23 22:20:14,570 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 357 transitions. Word has length 55 [2019-11-23 22:20:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:14,570 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 357 transitions. [2019-11-23 22:20:14,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 357 transitions. [2019-11-23 22:20:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:20:14,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:14,572 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:14,572 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:14,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:14,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1187342961, now seen corresponding path program 1 times [2019-11-23 22:20:14,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:14,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16852829] [2019-11-23 22:20:14,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:14,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16852829] [2019-11-23 22:20:14,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:14,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:14,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647715877] [2019-11-23 22:20:14,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:14,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:14,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:14,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:14,628 INFO L87 Difference]: Start difference. First operand 298 states and 357 transitions. Second operand 5 states. [2019-11-23 22:20:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:14,806 INFO L93 Difference]: Finished difference Result 306 states and 363 transitions. [2019-11-23 22:20:14,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:14,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-23 22:20:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:14,807 INFO L225 Difference]: With dead ends: 306 [2019-11-23 22:20:14,807 INFO L226 Difference]: Without dead ends: 302 [2019-11-23 22:20:14,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-23 22:20:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-23 22:20:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:20:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 356 transitions. [2019-11-23 22:20:14,850 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 356 transitions. Word has length 56 [2019-11-23 22:20:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:14,850 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 356 transitions. [2019-11-23 22:20:14,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 356 transitions. [2019-11-23 22:20:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:20:14,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:14,851 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:14,851 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:14,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1863906656, now seen corresponding path program 1 times [2019-11-23 22:20:14,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:14,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967079713] [2019-11-23 22:20:14,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:14,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967079713] [2019-11-23 22:20:14,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:14,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:14,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131809528] [2019-11-23 22:20:14,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:14,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:14,902 INFO L87 Difference]: Start difference. First operand 298 states and 356 transitions. Second operand 4 states. [2019-11-23 22:20:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:15,034 INFO L93 Difference]: Finished difference Result 302 states and 359 transitions. [2019-11-23 22:20:15,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:15,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-23 22:20:15,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:15,035 INFO L225 Difference]: With dead ends: 302 [2019-11-23 22:20:15,036 INFO L226 Difference]: Without dead ends: 284 [2019-11-23 22:20:15,036 INFO L630 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-11-23 22:20:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-23 22:20:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2019-11-23 22:20:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-23 22:20:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 340 transitions. [2019-11-23 22:20:15,073 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 340 transitions. Word has length 57 [2019-11-23 22:20:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:15,074 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 340 transitions. [2019-11-23 22:20:15,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 340 transitions. [2019-11-23 22:20:15,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 22:20:15,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:15,075 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:15,075 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:15,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:15,076 INFO L82 PathProgramCache]: Analyzing trace with hash -576201386, now seen corresponding path program 1 times [2019-11-23 22:20:15,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:15,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936433213] [2019-11-23 22:20:15,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:20:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:20:15,163 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:20:15,164 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:20:15,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:20:15 BoogieIcfgContainer [2019-11-23 22:20:15,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:20:15,323 INFO L168 Benchmark]: Toolchain (without parser) took 23254.43 ms. Allocated memory was 140.5 MB in the beginning and 687.9 MB in the end (delta: 547.4 MB). Free memory was 101.5 MB in the beginning and 579.6 MB in the end (delta: -478.0 MB). Peak memory consumption was 69.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:15,323 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:20:15,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.89 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 167.7 MB in the end (delta: -66.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:15,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.79 ms. Allocated memory is still 204.5 MB. Free memory was 167.7 MB in the beginning and 156.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:15,325 INFO L168 Benchmark]: Boogie Preprocessor took 146.80 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 149.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:15,325 INFO L168 Benchmark]: RCFGBuilder took 1941.17 ms. Allocated memory was 204.5 MB in the beginning and 251.1 MB in the end (delta: 46.7 MB). Free memory was 149.4 MB in the beginning and 201.9 MB in the end (delta: -52.6 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:15,326 INFO L168 Benchmark]: TraceAbstraction took 20311.91 ms. Allocated memory was 251.1 MB in the beginning and 687.9 MB in the end (delta: 436.7 MB). Free memory was 200.2 MB in the beginning and 579.6 MB in the end (delta: -379.4 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:15,328 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.22 ms. Allocated memory is still 140.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 711.89 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 167.7 MB in the end (delta: -66.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 136.79 ms. Allocated memory is still 204.5 MB. Free memory was 167.7 MB in the beginning and 156.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 146.80 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 149.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1941.17 ms. Allocated memory was 204.5 MB in the beginning and 251.1 MB in the end (delta: 46.7 MB). Free memory was 149.4 MB in the beginning and 201.9 MB in the end (delta: -52.6 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20311.91 ms. Allocated memory was 251.1 MB in the beginning and 687.9 MB in the end (delta: 436.7 MB). Free memory was 200.2 MB in the beginning and 579.6 MB in the end (delta: -379.4 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1625]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int FloppyThread ; [L41] int KernelMode ; [L42] int Suspended ; [L43] int Executive ; [L44] int DiskController ; [L45] int FloppyDiskPeripheral ; [L46] int FlConfigCallBack ; [L47] int MaximumInterfaceType ; [L48] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L49] int myStatus ; [L50] int s ; [L51] int UNLOADED ; [L52] int NP ; [L53] int DC ; [L54] int SKIP1 ; [L55] int SKIP2 ; [L56] int MPR1 ; [L57] int MPR3 ; [L58] int IPC ; [L59] int pended ; [L60] int compRegistered ; [L61] int lowerDriverReturn ; [L62] int setEventCalled ; [L63] int customIrp ; [L86] int PagingReferenceCount = 0; [L87] int PagingMutex = 0; VAL [compRegistered=0, customIrp=0, DC=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=0, MPR3=0, myStatus=0, NP=0, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L666] int status ; [L667] int irp = __VERIFIER_nondet_int() ; [L668] int pirp ; [L669] int pirp__IoStatus__Status ; [L670] int irp_choice = __VERIFIER_nondet_int() ; [L671] int devobj = __VERIFIER_nondet_int() ; [L672] int __cil_tmp8 ; [L674] FloppyThread = 0 [L675] KernelMode = 0 [L676] Suspended = 0 [L677] Executive = 0 [L678] DiskController = 0 [L679] FloppyDiskPeripheral = 0 [L680] FlConfigCallBack = 0 [L681] MaximumInterfaceType = 0 [L682] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L683] myStatus = 0 [L684] s = 0 [L685] UNLOADED = 0 [L686] NP = 0 [L687] DC = 0 [L688] SKIP1 = 0 [L689] SKIP2 = 0 [L690] MPR1 = 0 [L691] MPR3 = 0 [L692] IPC = 0 [L693] pended = 0 [L694] compRegistered = 0 [L695] lowerDriverReturn = 0 [L696] setEventCalled = 0 [L697] customIrp = 0 [L701] status = 0 [L702] pirp = irp [L69] UNLOADED = 0 [L70] NP = 1 [L71] DC = 2 [L72] SKIP1 = 3 [L73] SKIP2 = 4 [L74] MPR1 = 5 [L75] MPR3 = 6 [L76] IPC = 7 [L77] s = UNLOADED [L78] pended = 0 [L79] compRegistered = 0 [L80] lowerDriverReturn = 0 [L81] setEventCalled = 0 [L82] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L705] COND TRUE status >= 0 [L706] s = NP [L707] customIrp = 0 [L708] setEventCalled = customIrp [L709] lowerDriverReturn = setEventCalled [L710] compRegistered = lowerDriverReturn [L711] pended = compRegistered [L712] pirp__IoStatus__Status = 0 [L713] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L714] COND TRUE irp_choice == 0 [L715] pirp__IoStatus__Status = -1073741637 [L716] myStatus = -1073741637 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L656] s = NP [L657] pended = 0 [L658] compRegistered = 0 [L659] lowerDriverReturn = 0 [L660] setEventCalled = 0 [L661] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L722] COND FALSE !(status < 0) [L726] int tmp_ndt_1; [L727] tmp_ndt_1 = __VERIFIER_nondet_int() [L728] COND FALSE !(tmp_ndt_1 == 0) [L731] int tmp_ndt_2; [L732] tmp_ndt_2 = __VERIFIER_nondet_int() [L733] COND FALSE !(tmp_ndt_2 == 1) [L736] int tmp_ndt_3; [L737] tmp_ndt_3 = __VERIFIER_nondet_int() [L738] COND FALSE !(tmp_ndt_3 == 2) [L741] int tmp_ndt_4; [L742] tmp_ndt_4 = __VERIFIER_nondet_int() [L743] COND TRUE tmp_ndt_4 == 3 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L159] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L160] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L161] int Irp__IoStatus__Information ; [L162] int Irp__IoStatus__Status ; [L163] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L164] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L165] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L166] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L167] int disketteExtension__HoldNewRequests ; [L168] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L169] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L170] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L171] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L172] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L173] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L174] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L175] int irpSp ; [L176] int disketteExtension ; [L177] int ntStatus ; [L178] int doneEvent = __VERIFIER_nondet_int() ; [L179] int irpSp___0 ; [L180] int nextIrpSp ; [L181] int nextIrpSp__Control ; [L182] int irpSp___1 ; [L183] int irpSp__Context ; [L184] int irpSp__Control ; [L185] long __cil_tmp29 ; [L186] long __cil_tmp30 ; [L189] ntStatus = 0 [L190] PagingReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L191] COND TRUE PagingReferenceCount == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L194] disketteExtension = DeviceObject__DeviceExtension [L195] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L196] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L205] COND FALSE !(irpSp__MinorFunction == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L208] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L234] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L237] COND FALSE !(! disketteExtension__IsStarted) [L253] disketteExtension__HoldNewRequests = 1 [L96] int status ; [L97] int threadHandle = __VERIFIER_nondet_int() ; [L98] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L99] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L100] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L101] int Irp__IoStatus__Status ; [L102] int Irp__IoStatus__Information ; [L103] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L104] int ObjAttributes = __VERIFIER_nondet_int() ; [L105] int __cil_tmp12 ; [L106] int __cil_tmp13 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L109] COND FALSE !(DisketteExtension__PoweringDown == 1) [L115] DisketteExtension__ThreadReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L116] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L148] COND TRUE pended == 0 [L149] pended = 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L155] return (259); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L254] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L257] __cil_tmp29 = (long )ntStatus VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L258] COND TRUE __cil_tmp29 == 259L [L1064] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1073] COND FALSE !(customIrp == 1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1077] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1084] int tmp_ndt_12; [L1085] tmp_ndt_12 = __VERIFIER_nondet_int() [L1086] COND TRUE tmp_ndt_12 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1092] return (0); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L263] COND TRUE disketteExtension__FloppyThread != 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L266] disketteExtension__FloppyThread = 0 [L267] Irp__IoStatus__Status = 0 [L268] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L269] COND TRUE s == NP [L270] s = SKIP1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L277] Irp__CurrentLocation ++ [L278] Irp__Tail__Overlay__CurrentStackLocation ++ [L966] int returnVal2 ; [L967] int compRetStatus1 ; [L968] int lcontext = __VERIFIER_nondet_int() ; [L969] unsigned long __cil_tmp7 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L972] COND FALSE !(\read(compRegistered)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L985] int tmp_ndt_10; [L986] tmp_ndt_10 = __VERIFIER_nondet_int() [L987] COND TRUE tmp_ndt_10 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L998] returnVal2 = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1011] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1015] COND FALSE !(s == MPR1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1024] COND TRUE s == SKIP1 [L1025] s = SKIP2 [L1026] lowerDriverReturn = returnVal2 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1034] return (returnVal2); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L279] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L425] PagingReferenceCount -- VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L426] COND TRUE PagingReferenceCount == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L429] return (ntStatus); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L765] status = FloppyPnp(devobj, pirp) [L778] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L779] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L786] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L787] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L794] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L795] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L796] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L810] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L811] COND TRUE status != 259 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1625] __VERIFIER_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 572 locations, 54 error locations. Result: UNSAFE, OverallTime: 20.2s, OverallIterations: 58, TraceHistogramMax: 1, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 30824 SDtfs, 20140 SDslu, 66794 SDs, 0 SdLazy, 10004 SolverSat, 695 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=776occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 57 MinimizatonAttempts, 3830 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2017 NumberOfCodeBlocks, 2017 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1902 ConstructedInterpolants, 0 QuantifiedInterpolants, 180576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 57 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...