/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:41:53,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:41:53,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:41:53,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:41:53,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:41:53,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:41:53,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:41:53,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:41:53,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:41:53,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:41:53,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:41:53,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:41:53,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:41:53,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:41:53,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:41:53,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:41:53,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:41:53,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:41:53,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:41:53,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:41:53,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:41:53,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:41:53,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:41:53,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:41:53,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:41:53,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:41:53,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:41:53,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:41:53,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:41:53,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:41:53,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:41:53,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:41:53,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:41:53,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:41:53,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:41:53,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:41:53,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:41:53,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:41:53,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:41:53,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:41:53,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:41:53,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 01:41:53,837 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:41:53,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:41:53,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:41:53,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:41:53,839 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:41:53,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:41:53,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:41:53,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:41:53,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:41:53,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:41:53,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:41:53,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:41:53,841 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:41:53,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:41:53,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:41:53,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:41:53,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:41:53,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:41:53,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:41:53,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:41:53,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:41:53,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:41:53,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:41:53,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:41:53,843 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:41:53,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 01:41:54,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:41:54,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:41:54,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:41:54,242 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:41:54,243 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:41:54,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c [2020-12-23 01:41:54,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/11f57f9f7/96bb630902154af680264f6e4a100105/FLAG8b815f89c [2020-12-23 01:41:54,914 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:41:54,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c [2020-12-23 01:41:54,932 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/11f57f9f7/96bb630902154af680264f6e4a100105/FLAG8b815f89c [2020-12-23 01:41:55,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/11f57f9f7/96bb630902154af680264f6e4a100105 [2020-12-23 01:41:55,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:41:55,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:41:55,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:41:55,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:41:55,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:41:55,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:55" (1/1) ... [2020-12-23 01:41:55,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749417b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55, skipping insertion in model container [2020-12-23 01:41:55,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:55" (1/1) ... [2020-12-23 01:41:55,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:41:55,320 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:41:55,590 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c[42372,42385] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2020-12-23 01:41:55,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:41:55,614 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:41:55,698 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c[42372,42385] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2020-12-23 01:41:55,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:41:55,740 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:41:55,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55 WrapperNode [2020-12-23 01:41:55,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:41:55,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:41:55,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:41:55,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:41:55,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55" (1/1) ... [2020-12-23 01:41:55,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55" (1/1) ... [2020-12-23 01:41:55,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:41:55,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:41:55,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:41:55,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:41:55,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55" (1/1) ... [2020-12-23 01:41:55,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55" (1/1) ... [2020-12-23 01:41:55,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55" (1/1) ... [2020-12-23 01:41:55,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55" (1/1) ... [2020-12-23 01:41:55,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55" (1/1) ... [2020-12-23 01:41:55,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55" (1/1) ... [2020-12-23 01:41:55,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55" (1/1) ... [2020-12-23 01:41:55,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:41:55,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:41:55,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:41:55,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:41:55,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2020-12-23 01:41:56,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:41:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:41:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:41:56,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:41:56,288 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:41:56,989 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2020-12-23 01:41:56,990 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2020-12-23 01:41:57,002 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:41:57,003 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:41:57,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:57 BoogieIcfgContainer [2020-12-23 01:41:57,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:41:57,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:41:57,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:41:57,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:41:57,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:41:55" (1/3) ... [2020-12-23 01:41:57,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70dd5cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:41:57, skipping insertion in model container [2020-12-23 01:41:57,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:55" (2/3) ... [2020-12-23 01:41:57,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70dd5cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:41:57, skipping insertion in model container [2020-12-23 01:41:57,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:57" (3/3) ... [2020-12-23 01:41:57,017 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2020-12-23 01:41:57,025 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:41:57,031 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:41:57,054 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:41:57,089 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:41:57,089 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:41:57,089 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:41:57,089 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:41:57,090 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:41:57,090 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:41:57,090 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:41:57,090 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:41:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2020-12-23 01:41:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 01:41:57,123 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:57,124 INFO L422 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] [2020-12-23 01:41:57,124 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:57,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2020-12-23 01:41:57,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:57,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831529681] [2020-12-23 01:41:57,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:57,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831529681] [2020-12-23 01:41:57,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:57,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:57,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2160530] [2020-12-23 01:41:57,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:57,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:57,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:57,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:57,493 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2020-12-23 01:41:57,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:57,855 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2020-12-23 01:41:57,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:57,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-23 01:41:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:57,897 INFO L225 Difference]: With dead ends: 328 [2020-12-23 01:41:57,897 INFO L226 Difference]: Without dead ends: 175 [2020-12-23 01:41:57,905 INFO L677 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 [2020-12-23 01:41:57,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-23 01:41:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2020-12-23 01:41:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 01:41:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2020-12-23 01:41:58,002 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2020-12-23 01:41:58,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:58,004 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2020-12-23 01:41:58,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2020-12-23 01:41:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:41:58,013 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:58,014 INFO L422 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] [2020-12-23 01:41:58,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:41:58,014 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:58,017 INFO L82 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2020-12-23 01:41:58,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:58,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328127972] [2020-12-23 01:41:58,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:58,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328127972] [2020-12-23 01:41:58,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:58,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:58,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513060089] [2020-12-23 01:41:58,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:58,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:58,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:58,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:58,231 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand 3 states. [2020-12-23 01:41:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:58,529 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2020-12-23 01:41:58,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:58,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-23 01:41:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:58,533 INFO L225 Difference]: With dead ends: 380 [2020-12-23 01:41:58,533 INFO L226 Difference]: Without dead ends: 216 [2020-12-23 01:41:58,535 INFO L677 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 [2020-12-23 01:41:58,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-12-23 01:41:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2020-12-23 01:41:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-12-23 01:41:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2020-12-23 01:41:58,553 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2020-12-23 01:41:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:58,554 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2020-12-23 01:41:58,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2020-12-23 01:41:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 01:41:58,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:58,557 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:58,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:41:58,558 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:58,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:58,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2071968837, now seen corresponding path program 1 times [2020-12-23 01:41:58,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:58,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593389954] [2020-12-23 01:41:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:58,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593389954] [2020-12-23 01:41:58,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:58,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:58,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811771847] [2020-12-23 01:41:58,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:58,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:58,680 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand 3 states. [2020-12-23 01:41:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:58,901 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2020-12-23 01:41:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:58,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-23 01:41:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:58,904 INFO L225 Difference]: With dead ends: 445 [2020-12-23 01:41:58,904 INFO L226 Difference]: Without dead ends: 242 [2020-12-23 01:41:58,906 INFO L677 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 [2020-12-23 01:41:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-12-23 01:41:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-12-23 01:41:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-23 01:41:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2020-12-23 01:41:58,921 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2020-12-23 01:41:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:58,921 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2020-12-23 01:41:58,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2020-12-23 01:41:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:41:58,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:58,925 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:58,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:41:58,925 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:58,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:58,926 INFO L82 PathProgramCache]: Analyzing trace with hash -947039589, now seen corresponding path program 1 times [2020-12-23 01:41:58,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:58,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619050625] [2020-12-23 01:41:58,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:41:58,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619050625] [2020-12-23 01:41:58,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:58,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:58,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894213597] [2020-12-23 01:41:58,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:58,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:58,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:58,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:58,994 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand 3 states. [2020-12-23 01:41:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:59,148 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2020-12-23 01:41:59,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:59,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-12-23 01:41:59,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:59,151 INFO L225 Difference]: With dead ends: 493 [2020-12-23 01:41:59,151 INFO L226 Difference]: Without dead ends: 259 [2020-12-23 01:41:59,152 INFO L677 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 [2020-12-23 01:41:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-12-23 01:41:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2020-12-23 01:41:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-12-23 01:41:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2020-12-23 01:41:59,179 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2020-12-23 01:41:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:59,179 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2020-12-23 01:41:59,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2020-12-23 01:41:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:41:59,183 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:59,184 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:59,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:41:59,184 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:59,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1168944985, now seen corresponding path program 1 times [2020-12-23 01:41:59,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:59,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255307829] [2020-12-23 01:41:59,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:59,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255307829] [2020-12-23 01:41:59,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:59,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:59,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17461461] [2020-12-23 01:41:59,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:59,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:59,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:59,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:59,329 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand 3 states. [2020-12-23 01:41:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:59,548 INFO L93 Difference]: Finished difference Result 552 states and 931 transitions. [2020-12-23 01:41:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:59,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-12-23 01:41:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:59,553 INFO L225 Difference]: With dead ends: 552 [2020-12-23 01:41:59,553 INFO L226 Difference]: Without dead ends: 303 [2020-12-23 01:41:59,554 INFO L677 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 [2020-12-23 01:41:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-12-23 01:41:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2020-12-23 01:41:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-12-23 01:41:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2020-12-23 01:41:59,569 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2020-12-23 01:41:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:59,569 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2020-12-23 01:41:59,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2020-12-23 01:41:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 01:41:59,574 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:59,574 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:59,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:41:59,575 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:59,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:59,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2129818626, now seen corresponding path program 1 times [2020-12-23 01:41:59,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:59,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365176113] [2020-12-23 01:41:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:41:59,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365176113] [2020-12-23 01:41:59,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:59,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:59,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067820668] [2020-12-23 01:41:59,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:59,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:59,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:59,693 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand 3 states. [2020-12-23 01:41:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:59,852 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2020-12-23 01:41:59,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:59,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-23 01:41:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:59,855 INFO L225 Difference]: With dead ends: 592 [2020-12-23 01:41:59,855 INFO L226 Difference]: Without dead ends: 301 [2020-12-23 01:41:59,856 INFO L677 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 [2020-12-23 01:41:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-12-23 01:41:59,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2020-12-23 01:41:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-12-23 01:41:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2020-12-23 01:41:59,868 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2020-12-23 01:41:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:59,868 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2020-12-23 01:41:59,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2020-12-23 01:41:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 01:41:59,870 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:59,870 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:59,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:41:59,871 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:59,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:59,872 INFO L82 PathProgramCache]: Analyzing trace with hash -122958423, now seen corresponding path program 1 times [2020-12-23 01:41:59,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:59,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92480046] [2020-12-23 01:41:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:59,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92480046] [2020-12-23 01:41:59,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:59,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:59,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375561020] [2020-12-23 01:41:59,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:59,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:59,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:59,944 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand 3 states. [2020-12-23 01:42:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:00,178 INFO L93 Difference]: Finished difference Result 594 states and 995 transitions. [2020-12-23 01:42:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:00,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-23 01:42:00,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:00,187 INFO L225 Difference]: With dead ends: 594 [2020-12-23 01:42:00,187 INFO L226 Difference]: Without dead ends: 301 [2020-12-23 01:42:00,188 INFO L677 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 [2020-12-23 01:42:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-12-23 01:42:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2020-12-23 01:42:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-12-23 01:42:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2020-12-23 01:42:00,202 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2020-12-23 01:42:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:00,203 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2020-12-23 01:42:00,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2020-12-23 01:42:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:42:00,204 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:00,204 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:00,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:42:00,205 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:00,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:00,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1553184093, now seen corresponding path program 1 times [2020-12-23 01:42:00,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:00,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978784346] [2020-12-23 01:42:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:42:00,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978784346] [2020-12-23 01:42:00,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:00,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:00,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611782648] [2020-12-23 01:42:00,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:00,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:00,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:00,247 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand 3 states. [2020-12-23 01:42:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:00,380 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2020-12-23 01:42:00,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:00,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-12-23 01:42:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:00,383 INFO L225 Difference]: With dead ends: 595 [2020-12-23 01:42:00,383 INFO L226 Difference]: Without dead ends: 306 [2020-12-23 01:42:00,384 INFO L677 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 [2020-12-23 01:42:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-12-23 01:42:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2020-12-23 01:42:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-12-23 01:42:00,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2020-12-23 01:42:00,397 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2020-12-23 01:42:00,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:00,397 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2020-12-23 01:42:00,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2020-12-23 01:42:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:42:00,399 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:00,399 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:00,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:42:00,399 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2083521026, now seen corresponding path program 1 times [2020-12-23 01:42:00,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:00,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393184161] [2020-12-23 01:42:00,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:42:00,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393184161] [2020-12-23 01:42:00,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:00,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:00,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498175190] [2020-12-23 01:42:00,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:00,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:00,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:00,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:00,448 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 3 states. [2020-12-23 01:42:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:00,647 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2020-12-23 01:42:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:00,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-12-23 01:42:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:00,652 INFO L225 Difference]: With dead ends: 635 [2020-12-23 01:42:00,652 INFO L226 Difference]: Without dead ends: 337 [2020-12-23 01:42:00,653 INFO L677 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 [2020-12-23 01:42:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-12-23 01:42:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2020-12-23 01:42:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-12-23 01:42:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2020-12-23 01:42:00,671 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2020-12-23 01:42:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:00,671 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2020-12-23 01:42:00,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2020-12-23 01:42:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 01:42:00,676 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:00,676 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:00,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:42:00,677 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash -102460539, now seen corresponding path program 1 times [2020-12-23 01:42:00,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:00,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38439120] [2020-12-23 01:42:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:42:00,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38439120] [2020-12-23 01:42:00,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:00,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:00,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695677849] [2020-12-23 01:42:00,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:00,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:00,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:00,746 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand 3 states. [2020-12-23 01:42:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:00,964 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2020-12-23 01:42:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:00,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-12-23 01:42:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:00,973 INFO L225 Difference]: With dead ends: 664 [2020-12-23 01:42:00,973 INFO L226 Difference]: Without dead ends: 337 [2020-12-23 01:42:00,974 INFO L677 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 [2020-12-23 01:42:00,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-12-23 01:42:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2020-12-23 01:42:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-12-23 01:42:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2020-12-23 01:42:00,991 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2020-12-23 01:42:00,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:00,993 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2020-12-23 01:42:00,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2020-12-23 01:42:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:42:00,996 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:00,997 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:00,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:42:00,997 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:00,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:00,998 INFO L82 PathProgramCache]: Analyzing trace with hash -651386898, now seen corresponding path program 1 times [2020-12-23 01:42:00,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:00,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623984638] [2020-12-23 01:42:00,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:42:01,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623984638] [2020-12-23 01:42:01,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:01,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:01,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265068697] [2020-12-23 01:42:01,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:01,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:01,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:01,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:01,094 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand 3 states. [2020-12-23 01:42:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:01,341 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2020-12-23 01:42:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:01,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 01:42:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:01,344 INFO L225 Difference]: With dead ends: 697 [2020-12-23 01:42:01,345 INFO L226 Difference]: Without dead ends: 370 [2020-12-23 01:42:01,346 INFO L677 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 [2020-12-23 01:42:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-12-23 01:42:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2020-12-23 01:42:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-12-23 01:42:01,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2020-12-23 01:42:01,364 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2020-12-23 01:42:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:01,365 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2020-12-23 01:42:01,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:01,365 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2020-12-23 01:42:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:42:01,367 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:01,367 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:01,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:42:01,368 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1258189035, now seen corresponding path program 1 times [2020-12-23 01:42:01,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:01,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206707408] [2020-12-23 01:42:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:42:01,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206707408] [2020-12-23 01:42:01,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:01,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:01,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105115535] [2020-12-23 01:42:01,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:01,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:01,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:01,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:01,419 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand 3 states. [2020-12-23 01:42:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:01,598 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2020-12-23 01:42:01,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:01,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-23 01:42:01,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:01,601 INFO L225 Difference]: With dead ends: 724 [2020-12-23 01:42:01,601 INFO L226 Difference]: Without dead ends: 370 [2020-12-23 01:42:01,602 INFO L677 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 [2020-12-23 01:42:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-12-23 01:42:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2020-12-23 01:42:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-12-23 01:42:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2020-12-23 01:42:01,630 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2020-12-23 01:42:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:01,631 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2020-12-23 01:42:01,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2020-12-23 01:42:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 01:42:01,632 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:01,633 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:01,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:42:01,633 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:01,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1027805126, now seen corresponding path program 1 times [2020-12-23 01:42:01,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:01,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732600423] [2020-12-23 01:42:01,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-23 01:42:01,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732600423] [2020-12-23 01:42:01,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:01,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:01,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277118213] [2020-12-23 01:42:01,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:01,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:01,698 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand 3 states. [2020-12-23 01:42:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:01,859 INFO L93 Difference]: Finished difference Result 742 states and 1195 transitions. [2020-12-23 01:42:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:01,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 01:42:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:01,862 INFO L225 Difference]: With dead ends: 742 [2020-12-23 01:42:01,863 INFO L226 Difference]: Without dead ends: 388 [2020-12-23 01:42:01,864 INFO L677 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 [2020-12-23 01:42:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-23 01:42:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2020-12-23 01:42:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-12-23 01:42:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2020-12-23 01:42:01,879 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2020-12-23 01:42:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:01,880 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2020-12-23 01:42:01,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2020-12-23 01:42:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:42:01,882 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:01,882 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:01,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:42:01,882 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:01,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:01,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1570072403, now seen corresponding path program 1 times [2020-12-23 01:42:01,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:01,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648798175] [2020-12-23 01:42:01,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-23 01:42:01,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648798175] [2020-12-23 01:42:01,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:01,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:01,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054194439] [2020-12-23 01:42:01,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:01,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:01,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:01,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:01,938 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand 3 states. [2020-12-23 01:42:02,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:02,106 INFO L93 Difference]: Finished difference Result 763 states and 1218 transitions. [2020-12-23 01:42:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:02,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:42:02,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:02,109 INFO L225 Difference]: With dead ends: 763 [2020-12-23 01:42:02,110 INFO L226 Difference]: Without dead ends: 388 [2020-12-23 01:42:02,111 INFO L677 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 [2020-12-23 01:42:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-23 01:42:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2020-12-23 01:42:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-12-23 01:42:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2020-12-23 01:42:02,129 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2020-12-23 01:42:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:02,129 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2020-12-23 01:42:02,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2020-12-23 01:42:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-23 01:42:02,131 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:02,131 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:02,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:42:02,132 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:02,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1383340250, now seen corresponding path program 1 times [2020-12-23 01:42:02,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:02,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641525734] [2020-12-23 01:42:02,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-23 01:42:02,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641525734] [2020-12-23 01:42:02,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:02,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:02,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801771987] [2020-12-23 01:42:02,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:02,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:02,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:02,191 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand 3 states. [2020-12-23 01:42:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:02,246 INFO L93 Difference]: Finished difference Result 758 states and 1198 transitions. [2020-12-23 01:42:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:02,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-12-23 01:42:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:02,252 INFO L225 Difference]: With dead ends: 758 [2020-12-23 01:42:02,252 INFO L226 Difference]: Without dead ends: 756 [2020-12-23 01:42:02,253 INFO L677 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 [2020-12-23 01:42:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2020-12-23 01:42:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2020-12-23 01:42:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2020-12-23 01:42:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1196 transitions. [2020-12-23 01:42:02,287 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1196 transitions. Word has length 121 [2020-12-23 01:42:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:02,287 INFO L481 AbstractCegarLoop]: Abstraction has 756 states and 1196 transitions. [2020-12-23 01:42:02,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1196 transitions. [2020-12-23 01:42:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 01:42:02,290 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:02,291 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:02,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:42:02,291 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:02,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:02,292 INFO L82 PathProgramCache]: Analyzing trace with hash 56372730, now seen corresponding path program 1 times [2020-12-23 01:42:02,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:02,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641820258] [2020-12-23 01:42:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-23 01:42:02,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641820258] [2020-12-23 01:42:02,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:02,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:02,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54871053] [2020-12-23 01:42:02,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:02,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:02,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:02,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:02,352 INFO L87 Difference]: Start difference. First operand 756 states and 1196 transitions. Second operand 3 states. [2020-12-23 01:42:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:02,427 INFO L93 Difference]: Finished difference Result 1872 states and 2964 transitions. [2020-12-23 01:42:02,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:02,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2020-12-23 01:42:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:02,435 INFO L225 Difference]: With dead ends: 1872 [2020-12-23 01:42:02,435 INFO L226 Difference]: Without dead ends: 1124 [2020-12-23 01:42:02,437 INFO L677 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 [2020-12-23 01:42:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2020-12-23 01:42:02,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1124. [2020-12-23 01:42:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2020-12-23 01:42:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1777 transitions. [2020-12-23 01:42:02,490 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1777 transitions. Word has length 122 [2020-12-23 01:42:02,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:02,491 INFO L481 AbstractCegarLoop]: Abstraction has 1124 states and 1777 transitions. [2020-12-23 01:42:02,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1777 transitions. [2020-12-23 01:42:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 01:42:02,494 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:02,494 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:02,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:42:02,495 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:02,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1445666744, now seen corresponding path program 1 times [2020-12-23 01:42:02,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:02,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627525182] [2020-12-23 01:42:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-12-23 01:42:02,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627525182] [2020-12-23 01:42:02,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:02,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:02,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040452510] [2020-12-23 01:42:02,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:02,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:02,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:02,543 INFO L87 Difference]: Start difference. First operand 1124 states and 1777 transitions. Second operand 3 states. [2020-12-23 01:42:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:02,619 INFO L93 Difference]: Finished difference Result 2591 states and 4097 transitions. [2020-12-23 01:42:02,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:02,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2020-12-23 01:42:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:02,627 INFO L225 Difference]: With dead ends: 2591 [2020-12-23 01:42:02,627 INFO L226 Difference]: Without dead ends: 1475 [2020-12-23 01:42:02,633 INFO L677 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 [2020-12-23 01:42:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2020-12-23 01:42:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2020-12-23 01:42:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2020-12-23 01:42:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2328 transitions. [2020-12-23 01:42:02,700 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2328 transitions. Word has length 122 [2020-12-23 01:42:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:02,700 INFO L481 AbstractCegarLoop]: Abstraction has 1475 states and 2328 transitions. [2020-12-23 01:42:02,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2328 transitions. [2020-12-23 01:42:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 01:42:02,704 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:02,705 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:02,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:42:02,705 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:02,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:02,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1566103125, now seen corresponding path program 1 times [2020-12-23 01:42:02,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:02,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152673202] [2020-12-23 01:42:02,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-12-23 01:42:02,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152673202] [2020-12-23 01:42:02,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:02,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:02,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177078974] [2020-12-23 01:42:02,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:02,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:02,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:02,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:02,768 INFO L87 Difference]: Start difference. First operand 1475 states and 2328 transitions. Second operand 3 states. [2020-12-23 01:42:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:03,019 INFO L93 Difference]: Finished difference Result 2982 states and 4692 transitions. [2020-12-23 01:42:03,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:03,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2020-12-23 01:42:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:03,028 INFO L225 Difference]: With dead ends: 2982 [2020-12-23 01:42:03,028 INFO L226 Difference]: Without dead ends: 1515 [2020-12-23 01:42:03,031 INFO L677 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 [2020-12-23 01:42:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2020-12-23 01:42:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1475. [2020-12-23 01:42:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2020-12-23 01:42:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2184 transitions. [2020-12-23 01:42:03,090 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2184 transitions. Word has length 159 [2020-12-23 01:42:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:03,090 INFO L481 AbstractCegarLoop]: Abstraction has 1475 states and 2184 transitions. [2020-12-23 01:42:03,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2184 transitions. [2020-12-23 01:42:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 01:42:03,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:03,095 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:03,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:42:03,095 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:03,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:03,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1636228969, now seen corresponding path program 1 times [2020-12-23 01:42:03,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:03,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149093687] [2020-12-23 01:42:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-12-23 01:42:03,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149093687] [2020-12-23 01:42:03,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:03,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:03,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190282223] [2020-12-23 01:42:03,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:03,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:03,149 INFO L87 Difference]: Start difference. First operand 1475 states and 2184 transitions. Second operand 3 states. [2020-12-23 01:42:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:03,430 INFO L93 Difference]: Finished difference Result 3138 states and 4656 transitions. [2020-12-23 01:42:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:03,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2020-12-23 01:42:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:03,441 INFO L225 Difference]: With dead ends: 3138 [2020-12-23 01:42:03,441 INFO L226 Difference]: Without dead ends: 1671 [2020-12-23 01:42:03,444 INFO L677 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 [2020-12-23 01:42:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2020-12-23 01:42:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1555. [2020-12-23 01:42:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-12-23 01:42:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2244 transitions. [2020-12-23 01:42:03,521 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2244 transitions. Word has length 159 [2020-12-23 01:42:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:03,521 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 2244 transitions. [2020-12-23 01:42:03,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2244 transitions. [2020-12-23 01:42:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-23 01:42:03,527 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:03,527 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:03,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:42:03,527 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:03,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash 442177989, now seen corresponding path program 1 times [2020-12-23 01:42:03,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:03,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330340022] [2020-12-23 01:42:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2020-12-23 01:42:03,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330340022] [2020-12-23 01:42:03,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:03,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:03,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567900100] [2020-12-23 01:42:03,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:03,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:03,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:03,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:03,584 INFO L87 Difference]: Start difference. First operand 1555 states and 2244 transitions. Second operand 3 states. [2020-12-23 01:42:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:03,830 INFO L93 Difference]: Finished difference Result 3158 states and 4542 transitions. [2020-12-23 01:42:03,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:03,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2020-12-23 01:42:03,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:03,839 INFO L225 Difference]: With dead ends: 3158 [2020-12-23 01:42:03,840 INFO L226 Difference]: Without dead ends: 1611 [2020-12-23 01:42:03,843 INFO L677 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 [2020-12-23 01:42:03,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2020-12-23 01:42:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1555. [2020-12-23 01:42:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-12-23 01:42:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2182 transitions. [2020-12-23 01:42:03,907 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2182 transitions. Word has length 173 [2020-12-23 01:42:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:03,907 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 2182 transitions. [2020-12-23 01:42:03,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2182 transitions. [2020-12-23 01:42:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-12-23 01:42:03,912 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:03,912 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:03,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:42:03,913 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:03,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:03,913 INFO L82 PathProgramCache]: Analyzing trace with hash 893492071, now seen corresponding path program 1 times [2020-12-23 01:42:03,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:03,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874129498] [2020-12-23 01:42:03,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-12-23 01:42:03,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874129498] [2020-12-23 01:42:03,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:03,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:03,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47798080] [2020-12-23 01:42:03,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:03,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:03,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:03,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:03,995 INFO L87 Difference]: Start difference. First operand 1555 states and 2182 transitions. Second operand 3 states. [2020-12-23 01:42:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:04,185 INFO L93 Difference]: Finished difference Result 3187 states and 4459 transitions. [2020-12-23 01:42:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:04,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2020-12-23 01:42:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:04,195 INFO L225 Difference]: With dead ends: 3187 [2020-12-23 01:42:04,195 INFO L226 Difference]: Without dead ends: 1640 [2020-12-23 01:42:04,198 INFO L677 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 [2020-12-23 01:42:04,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2020-12-23 01:42:04,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1624. [2020-12-23 01:42:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2020-12-23 01:42:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2266 transitions. [2020-12-23 01:42:04,262 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2266 transitions. Word has length 189 [2020-12-23 01:42:04,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:04,262 INFO L481 AbstractCegarLoop]: Abstraction has 1624 states and 2266 transitions. [2020-12-23 01:42:04,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2266 transitions. [2020-12-23 01:42:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-12-23 01:42:04,268 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:04,269 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:04,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:42:04,269 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1767840956, now seen corresponding path program 1 times [2020-12-23 01:42:04,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:04,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628185073] [2020-12-23 01:42:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2020-12-23 01:42:04,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628185073] [2020-12-23 01:42:04,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:04,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:04,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430034995] [2020-12-23 01:42:04,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:04,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:04,391 INFO L87 Difference]: Start difference. First operand 1624 states and 2266 transitions. Second operand 3 states. [2020-12-23 01:42:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:04,596 INFO L93 Difference]: Finished difference Result 3392 states and 4736 transitions. [2020-12-23 01:42:04,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:04,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2020-12-23 01:42:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:04,606 INFO L225 Difference]: With dead ends: 3392 [2020-12-23 01:42:04,607 INFO L226 Difference]: Without dead ends: 1776 [2020-12-23 01:42:04,610 INFO L677 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 [2020-12-23 01:42:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2020-12-23 01:42:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1724. [2020-12-23 01:42:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2020-12-23 01:42:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2386 transitions. [2020-12-23 01:42:04,678 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2386 transitions. Word has length 210 [2020-12-23 01:42:04,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:04,679 INFO L481 AbstractCegarLoop]: Abstraction has 1724 states and 2386 transitions. [2020-12-23 01:42:04,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2386 transitions. [2020-12-23 01:42:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-23 01:42:04,685 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:04,685 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:04,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:42:04,685 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:04,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:04,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1550608766, now seen corresponding path program 1 times [2020-12-23 01:42:04,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:04,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378329062] [2020-12-23 01:42:04,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-12-23 01:42:04,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378329062] [2020-12-23 01:42:04,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:04,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:04,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457000882] [2020-12-23 01:42:04,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:04,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:04,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:04,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:04,763 INFO L87 Difference]: Start difference. First operand 1724 states and 2386 transitions. Second operand 3 states. [2020-12-23 01:42:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:05,036 INFO L93 Difference]: Finished difference Result 3494 states and 4822 transitions. [2020-12-23 01:42:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:05,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2020-12-23 01:42:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:05,046 INFO L225 Difference]: With dead ends: 3494 [2020-12-23 01:42:05,046 INFO L226 Difference]: Without dead ends: 1778 [2020-12-23 01:42:05,050 INFO L677 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 [2020-12-23 01:42:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2020-12-23 01:42:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1724. [2020-12-23 01:42:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2020-12-23 01:42:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2378 transitions. [2020-12-23 01:42:05,121 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2378 transitions. Word has length 213 [2020-12-23 01:42:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:05,121 INFO L481 AbstractCegarLoop]: Abstraction has 1724 states and 2378 transitions. [2020-12-23 01:42:05,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2378 transitions. [2020-12-23 01:42:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-12-23 01:42:05,127 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:05,128 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:05,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:42:05,128 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash -615950364, now seen corresponding path program 1 times [2020-12-23 01:42:05,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:05,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355864716] [2020-12-23 01:42:05,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2020-12-23 01:42:05,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355864716] [2020-12-23 01:42:05,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:05,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:05,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356855415] [2020-12-23 01:42:05,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:05,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:05,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:05,231 INFO L87 Difference]: Start difference. First operand 1724 states and 2378 transitions. Second operand 3 states. [2020-12-23 01:42:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:05,539 INFO L93 Difference]: Finished difference Result 3636 states and 5036 transitions. [2020-12-23 01:42:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:05,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2020-12-23 01:42:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:05,549 INFO L225 Difference]: With dead ends: 3636 [2020-12-23 01:42:05,550 INFO L226 Difference]: Without dead ends: 1820 [2020-12-23 01:42:05,553 INFO L677 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 [2020-12-23 01:42:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2020-12-23 01:42:05,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1780. [2020-12-23 01:42:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2020-12-23 01:42:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2422 transitions. [2020-12-23 01:42:05,641 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2422 transitions. Word has length 234 [2020-12-23 01:42:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:05,642 INFO L481 AbstractCegarLoop]: Abstraction has 1780 states and 2422 transitions. [2020-12-23 01:42:05,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2422 transitions. [2020-12-23 01:42:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-12-23 01:42:05,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:05,650 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:05,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:42:05,650 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1751905145, now seen corresponding path program 1 times [2020-12-23 01:42:05,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:05,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765760461] [2020-12-23 01:42:05,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2020-12-23 01:42:05,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765760461] [2020-12-23 01:42:05,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:05,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:05,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527582895] [2020-12-23 01:42:05,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:05,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:05,754 INFO L87 Difference]: Start difference. First operand 1780 states and 2422 transitions. Second operand 3 states. [2020-12-23 01:42:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:05,961 INFO L93 Difference]: Finished difference Result 3584 states and 4884 transitions. [2020-12-23 01:42:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:05,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2020-12-23 01:42:05,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:05,971 INFO L225 Difference]: With dead ends: 3584 [2020-12-23 01:42:05,971 INFO L226 Difference]: Without dead ends: 1812 [2020-12-23 01:42:05,974 INFO L677 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 [2020-12-23 01:42:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2020-12-23 01:42:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1780. [2020-12-23 01:42:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2020-12-23 01:42:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2402 transitions. [2020-12-23 01:42:06,097 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2402 transitions. Word has length 236 [2020-12-23 01:42:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:06,098 INFO L481 AbstractCegarLoop]: Abstraction has 1780 states and 2402 transitions. [2020-12-23 01:42:06,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2402 transitions. [2020-12-23 01:42:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-12-23 01:42:06,104 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:06,104 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:06,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:42:06,104 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash 264243297, now seen corresponding path program 1 times [2020-12-23 01:42:06,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:06,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452970671] [2020-12-23 01:42:06,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2020-12-23 01:42:06,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452970671] [2020-12-23 01:42:06,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670284943] [2020-12-23 01:42:06,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:06,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 01:42:06,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2020-12-23 01:42:06,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:42:06,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 01:42:06,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893593964] [2020-12-23 01:42:06,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:06,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:06,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:06,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:06,977 INFO L87 Difference]: Start difference. First operand 1780 states and 2402 transitions. Second operand 3 states. [2020-12-23 01:42:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:07,060 INFO L93 Difference]: Finished difference Result 3574 states and 4830 transitions. [2020-12-23 01:42:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:07,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2020-12-23 01:42:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:07,072 INFO L225 Difference]: With dead ends: 3574 [2020-12-23 01:42:07,072 INFO L226 Difference]: Without dead ends: 2235 [2020-12-23 01:42:07,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2020-12-23 01:42:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2235. [2020-12-23 01:42:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2020-12-23 01:42:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 3017 transitions. [2020-12-23 01:42:07,156 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 3017 transitions. Word has length 246 [2020-12-23 01:42:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:07,157 INFO L481 AbstractCegarLoop]: Abstraction has 2235 states and 3017 transitions. [2020-12-23 01:42:07,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 3017 transitions. [2020-12-23 01:42:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-12-23 01:42:07,164 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:07,164 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:07,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-23 01:42:07,378 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1153610059, now seen corresponding path program 1 times [2020-12-23 01:42:07,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:07,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611586102] [2020-12-23 01:42:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-12-23 01:42:07,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611586102] [2020-12-23 01:42:07,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333548532] [2020-12-23 01:42:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:07,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:07,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-12-23 01:42:07,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:42:07,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 01:42:07,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088591828] [2020-12-23 01:42:07,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:42:07,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:07,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:42:07,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:42:07,977 INFO L87 Difference]: Start difference. First operand 2235 states and 3017 transitions. Second operand 4 states. [2020-12-23 01:42:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:08,579 INFO L93 Difference]: Finished difference Result 7149 states and 9661 transitions. [2020-12-23 01:42:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:42:08,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2020-12-23 01:42:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:08,622 INFO L225 Difference]: With dead ends: 7149 [2020-12-23 01:42:08,622 INFO L226 Difference]: Without dead ends: 4922 [2020-12-23 01:42:08,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4922 states. [2020-12-23 01:42:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4922 to 2780. [2020-12-23 01:42:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2780 states. [2020-12-23 01:42:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 3667 transitions. [2020-12-23 01:42:08,799 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 3667 transitions. Word has length 253 [2020-12-23 01:42:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:08,799 INFO L481 AbstractCegarLoop]: Abstraction has 2780 states and 3667 transitions. [2020-12-23 01:42:08,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:42:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 3667 transitions. [2020-12-23 01:42:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-12-23 01:42:08,810 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:08,811 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:09,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-23 01:42:09,026 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:09,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:09,026 INFO L82 PathProgramCache]: Analyzing trace with hash -864790669, now seen corresponding path program 1 times [2020-12-23 01:42:09,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:09,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45555757] [2020-12-23 01:42:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2020-12-23 01:42:09,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45555757] [2020-12-23 01:42:09,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:09,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:09,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006383770] [2020-12-23 01:42:09,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:09,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:09,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:09,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:09,212 INFO L87 Difference]: Start difference. First operand 2780 states and 3667 transitions. Second operand 3 states. [2020-12-23 01:42:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:09,395 INFO L93 Difference]: Finished difference Result 7809 states and 10357 transitions. [2020-12-23 01:42:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:09,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2020-12-23 01:42:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:09,410 INFO L225 Difference]: With dead ends: 7809 [2020-12-23 01:42:09,410 INFO L226 Difference]: Without dead ends: 5037 [2020-12-23 01:42:09,416 INFO L677 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 [2020-12-23 01:42:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5037 states. [2020-12-23 01:42:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5037 to 5035. [2020-12-23 01:42:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5035 states. [2020-12-23 01:42:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6687 transitions. [2020-12-23 01:42:09,644 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6687 transitions. Word has length 253 [2020-12-23 01:42:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:09,645 INFO L481 AbstractCegarLoop]: Abstraction has 5035 states and 6687 transitions. [2020-12-23 01:42:09,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6687 transitions. [2020-12-23 01:42:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-12-23 01:42:09,661 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:09,661 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:09,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:42:09,662 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:09,662 INFO L82 PathProgramCache]: Analyzing trace with hash 52349753, now seen corresponding path program 1 times [2020-12-23 01:42:09,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:09,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441587983] [2020-12-23 01:42:09,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2020-12-23 01:42:09,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441587983] [2020-12-23 01:42:09,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:09,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:09,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389880365] [2020-12-23 01:42:09,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:09,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:09,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:09,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:09,839 INFO L87 Difference]: Start difference. First operand 5035 states and 6687 transitions. Second operand 3 states. [2020-12-23 01:42:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:10,194 INFO L93 Difference]: Finished difference Result 10162 states and 13482 transitions. [2020-12-23 01:42:10,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:10,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2020-12-23 01:42:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:10,207 INFO L225 Difference]: With dead ends: 10162 [2020-12-23 01:42:10,207 INFO L226 Difference]: Without dead ends: 5135 [2020-12-23 01:42:10,217 INFO L677 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 [2020-12-23 01:42:10,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2020-12-23 01:42:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 5035. [2020-12-23 01:42:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5035 states. [2020-12-23 01:42:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6601 transitions. [2020-12-23 01:42:10,420 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6601 transitions. Word has length 256 [2020-12-23 01:42:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:10,421 INFO L481 AbstractCegarLoop]: Abstraction has 5035 states and 6601 transitions. [2020-12-23 01:42:10,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6601 transitions. [2020-12-23 01:42:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2020-12-23 01:42:10,434 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:10,434 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:10,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 01:42:10,435 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:10,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:10,435 INFO L82 PathProgramCache]: Analyzing trace with hash 212492165, now seen corresponding path program 1 times [2020-12-23 01:42:10,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:10,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881689447] [2020-12-23 01:42:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2020-12-23 01:42:10,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881689447] [2020-12-23 01:42:10,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945264908] [2020-12-23 01:42:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:10,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 01:42:10,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2020-12-23 01:42:11,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:42:11,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 01:42:11,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810604462] [2020-12-23 01:42:11,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:11,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:11,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:11,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:11,033 INFO L87 Difference]: Start difference. First operand 5035 states and 6601 transitions. Second operand 3 states. [2020-12-23 01:42:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:11,398 INFO L93 Difference]: Finished difference Result 9422 states and 12426 transitions. [2020-12-23 01:42:11,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:11,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2020-12-23 01:42:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:11,411 INFO L225 Difference]: With dead ends: 9422 [2020-12-23 01:42:11,411 INFO L226 Difference]: Without dead ends: 5375 [2020-12-23 01:42:11,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5375 states. [2020-12-23 01:42:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5375 to 5055. [2020-12-23 01:42:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5055 states. [2020-12-23 01:42:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 6607 transitions. [2020-12-23 01:42:11,621 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 6607 transitions. Word has length 282 [2020-12-23 01:42:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:11,622 INFO L481 AbstractCegarLoop]: Abstraction has 5055 states and 6607 transitions. [2020-12-23 01:42:11,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:11,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 6607 transitions. [2020-12-23 01:42:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-12-23 01:42:11,636 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:11,636 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:11,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:11,850 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:11,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1760130215, now seen corresponding path program 1 times [2020-12-23 01:42:11,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:11,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50365174] [2020-12-23 01:42:11,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2020-12-23 01:42:12,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50365174] [2020-12-23 01:42:12,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408143202] [2020-12-23 01:42:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:12,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:12,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2020-12-23 01:42:12,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:42:12,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 01:42:12,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470230050] [2020-12-23 01:42:12,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:12,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:12,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:12,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:12,421 INFO L87 Difference]: Start difference. First operand 5055 states and 6607 transitions. Second operand 3 states. [2020-12-23 01:42:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:12,731 INFO L93 Difference]: Finished difference Result 10102 states and 13202 transitions. [2020-12-23 01:42:12,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:12,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2020-12-23 01:42:12,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:12,744 INFO L225 Difference]: With dead ends: 10102 [2020-12-23 01:42:12,744 INFO L226 Difference]: Without dead ends: 5055 [2020-12-23 01:42:12,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5055 states. [2020-12-23 01:42:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5055 to 5055. [2020-12-23 01:42:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5055 states. [2020-12-23 01:42:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 6597 transitions. [2020-12-23 01:42:12,979 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 6597 transitions. Word has length 283 [2020-12-23 01:42:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:12,979 INFO L481 AbstractCegarLoop]: Abstraction has 5055 states and 6597 transitions. [2020-12-23 01:42:12,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 6597 transitions. [2020-12-23 01:42:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-12-23 01:42:12,994 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:12,994 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:13,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:13,209 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:13,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash 228335597, now seen corresponding path program 1 times [2020-12-23 01:42:13,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:13,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403592681] [2020-12-23 01:42:13,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2020-12-23 01:42:13,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403592681] [2020-12-23 01:42:13,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434234122] [2020-12-23 01:42:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:13,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:13,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2020-12-23 01:42:13,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:42:13,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 01:42:13,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355207562] [2020-12-23 01:42:13,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:42:13,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:13,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:42:13,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:42:13,850 INFO L87 Difference]: Start difference. First operand 5055 states and 6597 transitions. Second operand 4 states. [2020-12-23 01:42:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:14,480 INFO L93 Difference]: Finished difference Result 11826 states and 15346 transitions. [2020-12-23 01:42:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:42:14,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2020-12-23 01:42:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:14,495 INFO L225 Difference]: With dead ends: 11826 [2020-12-23 01:42:14,495 INFO L226 Difference]: Without dead ends: 6713 [2020-12-23 01:42:14,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6713 states. [2020-12-23 01:42:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6713 to 4419. [2020-12-23 01:42:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2020-12-23 01:42:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 5676 transitions. [2020-12-23 01:42:14,680 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 5676 transitions. Word has length 283 [2020-12-23 01:42:14,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:14,681 INFO L481 AbstractCegarLoop]: Abstraction has 4419 states and 5676 transitions. [2020-12-23 01:42:14,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:42:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 5676 transitions. [2020-12-23 01:42:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2020-12-23 01:42:14,696 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:14,696 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:14,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-12-23 01:42:14,910 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:14,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:14,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1511923228, now seen corresponding path program 1 times [2020-12-23 01:42:14,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:14,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484107677] [2020-12-23 01:42:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2020-12-23 01:42:15,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484107677] [2020-12-23 01:42:15,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:15,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:15,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220464755] [2020-12-23 01:42:15,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:15,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:15,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:15,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:15,075 INFO L87 Difference]: Start difference. First operand 4419 states and 5676 transitions. Second operand 3 states. [2020-12-23 01:42:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:15,293 INFO L93 Difference]: Finished difference Result 7455 states and 9474 transitions. [2020-12-23 01:42:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:15,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2020-12-23 01:42:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:15,301 INFO L225 Difference]: With dead ends: 7455 [2020-12-23 01:42:15,301 INFO L226 Difference]: Without dead ends: 2236 [2020-12-23 01:42:15,310 INFO L677 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 [2020-12-23 01:42:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2020-12-23 01:42:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2236. [2020-12-23 01:42:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2236 states. [2020-12-23 01:42:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2826 transitions. [2020-12-23 01:42:15,398 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2826 transitions. Word has length 321 [2020-12-23 01:42:15,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:15,399 INFO L481 AbstractCegarLoop]: Abstraction has 2236 states and 2826 transitions. [2020-12-23 01:42:15,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2826 transitions. [2020-12-23 01:42:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2020-12-23 01:42:15,405 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:15,406 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:15,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 01:42:15,406 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash 761483812, now seen corresponding path program 1 times [2020-12-23 01:42:15,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:15,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354225800] [2020-12-23 01:42:15,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2020-12-23 01:42:15,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354225800] [2020-12-23 01:42:15,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:15,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:15,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418520849] [2020-12-23 01:42:15,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:15,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:15,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:15,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:15,581 INFO L87 Difference]: Start difference. First operand 2236 states and 2826 transitions. Second operand 3 states. [2020-12-23 01:42:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:15,758 INFO L93 Difference]: Finished difference Result 4474 states and 5650 transitions. [2020-12-23 01:42:15,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:15,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2020-12-23 01:42:15,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:15,763 INFO L225 Difference]: With dead ends: 4474 [2020-12-23 01:42:15,764 INFO L226 Difference]: Without dead ends: 2246 [2020-12-23 01:42:15,767 INFO L677 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 [2020-12-23 01:42:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2020-12-23 01:42:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2236. [2020-12-23 01:42:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2236 states. [2020-12-23 01:42:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2801 transitions. [2020-12-23 01:42:15,866 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2801 transitions. Word has length 360 [2020-12-23 01:42:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:15,867 INFO L481 AbstractCegarLoop]: Abstraction has 2236 states and 2801 transitions. [2020-12-23 01:42:15,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2801 transitions. [2020-12-23 01:42:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2020-12-23 01:42:15,873 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:15,873 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:15,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 01:42:15,873 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:15,874 INFO L82 PathProgramCache]: Analyzing trace with hash 35349519, now seen corresponding path program 1 times [2020-12-23 01:42:15,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:15,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766346306] [2020-12-23 01:42:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-12-23 01:42:16,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766346306] [2020-12-23 01:42:16,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826526888] [2020-12-23 01:42:16,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:16,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:16,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2020-12-23 01:42:16,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:42:16,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 01:42:16,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320882504] [2020-12-23 01:42:16,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:16,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:16,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:16,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:16,651 INFO L87 Difference]: Start difference. First operand 2236 states and 2801 transitions. Second operand 3 states. [2020-12-23 01:42:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:16,727 INFO L93 Difference]: Finished difference Result 2855 states and 3603 transitions. [2020-12-23 01:42:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:16,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2020-12-23 01:42:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:16,757 INFO L225 Difference]: With dead ends: 2855 [2020-12-23 01:42:16,757 INFO L226 Difference]: Without dead ends: 2763 [2020-12-23 01:42:16,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2020-12-23 01:42:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2146. [2020-12-23 01:42:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2020-12-23 01:42:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2700 transitions. [2020-12-23 01:42:16,834 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2700 transitions. Word has length 393 [2020-12-23 01:42:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:16,835 INFO L481 AbstractCegarLoop]: Abstraction has 2146 states and 2700 transitions. [2020-12-23 01:42:16,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2700 transitions. [2020-12-23 01:42:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2020-12-23 01:42:16,842 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:16,843 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:17,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:17,059 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:17,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:17,060 INFO L82 PathProgramCache]: Analyzing trace with hash 431667755, now seen corresponding path program 1 times [2020-12-23 01:42:17,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:17,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175531243] [2020-12-23 01:42:17,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2020-12-23 01:42:17,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175531243] [2020-12-23 01:42:17,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560866218] [2020-12-23 01:42:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:17,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:17,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2020-12-23 01:42:18,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:42:18,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 01:42:18,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451944387] [2020-12-23 01:42:18,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:42:18,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:18,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:42:18,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:42:18,279 INFO L87 Difference]: Start difference. First operand 2146 states and 2700 transitions. Second operand 4 states. [2020-12-23 01:42:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:18,678 INFO L93 Difference]: Finished difference Result 5212 states and 6569 transitions. [2020-12-23 01:42:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:42:18,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 533 [2020-12-23 01:42:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:18,685 INFO L225 Difference]: With dead ends: 5212 [2020-12-23 01:42:18,685 INFO L226 Difference]: Without dead ends: 3032 [2020-12-23 01:42:18,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2020-12-23 01:42:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2206. [2020-12-23 01:42:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2020-12-23 01:42:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 2780 transitions. [2020-12-23 01:42:18,769 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 2780 transitions. Word has length 533 [2020-12-23 01:42:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:18,769 INFO L481 AbstractCegarLoop]: Abstraction has 2206 states and 2780 transitions. [2020-12-23 01:42:18,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:42:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2780 transitions. [2020-12-23 01:42:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2020-12-23 01:42:18,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:18,783 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:18,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-12-23 01:42:18,986 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash 316649701, now seen corresponding path program 1 times [2020-12-23 01:42:18,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:18,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747531866] [2020-12-23 01:42:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2020-12-23 01:42:19,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747531866] [2020-12-23 01:42:19,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:19,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:19,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799354184] [2020-12-23 01:42:19,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:19,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:19,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:19,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:19,359 INFO L87 Difference]: Start difference. First operand 2206 states and 2780 transitions. Second operand 3 states. [2020-12-23 01:42:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:19,574 INFO L93 Difference]: Finished difference Result 4584 states and 5788 transitions. [2020-12-23 01:42:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:19,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 595 [2020-12-23 01:42:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:19,581 INFO L225 Difference]: With dead ends: 4584 [2020-12-23 01:42:19,582 INFO L226 Difference]: Without dead ends: 2386 [2020-12-23 01:42:19,585 INFO L677 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 [2020-12-23 01:42:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-12-23 01:42:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2376. [2020-12-23 01:42:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2376 states. [2020-12-23 01:42:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 2975 transitions. [2020-12-23 01:42:19,683 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 2975 transitions. Word has length 595 [2020-12-23 01:42:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:19,684 INFO L481 AbstractCegarLoop]: Abstraction has 2376 states and 2975 transitions. [2020-12-23 01:42:19,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2975 transitions. [2020-12-23 01:42:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2020-12-23 01:42:19,694 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:19,694 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:19,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 01:42:19,695 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:19,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:19,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1796704043, now seen corresponding path program 1 times [2020-12-23 01:42:19,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:19,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789830467] [2020-12-23 01:42:19,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2020-12-23 01:42:20,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789830467] [2020-12-23 01:42:20,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:20,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:20,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347678435] [2020-12-23 01:42:20,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:20,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:20,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:20,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:20,034 INFO L87 Difference]: Start difference. First operand 2376 states and 2975 transitions. Second operand 3 states. [2020-12-23 01:42:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:20,262 INFO L93 Difference]: Finished difference Result 4739 states and 5928 transitions. [2020-12-23 01:42:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:20,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 657 [2020-12-23 01:42:20,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:20,268 INFO L225 Difference]: With dead ends: 4739 [2020-12-23 01:42:20,269 INFO L226 Difference]: Without dead ends: 2371 [2020-12-23 01:42:20,273 INFO L677 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 [2020-12-23 01:42:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2020-12-23 01:42:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2371. [2020-12-23 01:42:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2371 states. [2020-12-23 01:42:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 2920 transitions. [2020-12-23 01:42:20,355 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 2920 transitions. Word has length 657 [2020-12-23 01:42:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:20,356 INFO L481 AbstractCegarLoop]: Abstraction has 2371 states and 2920 transitions. [2020-12-23 01:42:20,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2920 transitions. [2020-12-23 01:42:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2020-12-23 01:42:20,368 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:20,368 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:20,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 01:42:20,369 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:20,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:20,369 INFO L82 PathProgramCache]: Analyzing trace with hash -372840571, now seen corresponding path program 1 times [2020-12-23 01:42:20,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:20,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872499577] [2020-12-23 01:42:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2020-12-23 01:42:20,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872499577] [2020-12-23 01:42:20,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382411981] [2020-12-23 01:42:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:21,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:21,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2020-12-23 01:42:21,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:42:21,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 01:42:21,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196537265] [2020-12-23 01:42:21,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:42:21,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:21,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:42:21,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:42:21,767 INFO L87 Difference]: Start difference. First operand 2371 states and 2920 transitions. Second operand 4 states. [2020-12-23 01:42:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:22,017 INFO L93 Difference]: Finished difference Result 4081 states and 5070 transitions. [2020-12-23 01:42:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:42:22,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 723 [2020-12-23 01:42:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:22,019 INFO L225 Difference]: With dead ends: 4081 [2020-12-23 01:42:22,019 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 01:42:22,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 01:42:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 01:42:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 01:42:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 01:42:22,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 723 [2020-12-23 01:42:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:22,024 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 01:42:22,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:42:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 01:42:22,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 01:42:22,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-12-23 01:42:22,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 01:42:22,409 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2020-12-23 01:42:24,120 WARN L197 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 437 DAG size of output: 270 [2020-12-23 01:42:24,387 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2020-12-23 01:42:24,581 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 88 [2020-12-23 01:42:25,806 WARN L197 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 437 DAG size of output: 270 [2020-12-23 01:42:26,721 WARN L197 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 33 [2020-12-23 01:42:27,060 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-12-23 01:42:27,618 WARN L197 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 42 [2020-12-23 01:42:28,167 WARN L197 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 32 [2020-12-23 01:42:33,569 WARN L197 SmtUtils]: Spent 5.40 s on a formula simplification. DAG size of input: 220 DAG size of output: 111 [2020-12-23 01:42:34,220 WARN L197 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 34 [2020-12-23 01:42:34,990 WARN L197 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2020-12-23 01:42:35,618 WARN L197 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 24 [2020-12-23 01:42:36,038 WARN L197 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2020-12-23 01:42:36,575 WARN L197 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-12-23 01:42:41,927 WARN L197 SmtUtils]: Spent 5.33 s on a formula simplification. DAG size of input: 220 DAG size of output: 111 [2020-12-23 01:42:42,544 WARN L197 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 34 [2020-12-23 01:42:42,995 WARN L197 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 26 [2020-12-23 01:42:43,629 WARN L197 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2020-12-23 01:42:44,045 WARN L197 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 29 [2020-12-23 01:42:44,293 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2020-12-23 01:42:44,688 WARN L197 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2020-12-23 01:42:45,047 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 29 [2020-12-23 01:42:45,431 WARN L197 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2020-12-23 01:42:45,944 WARN L197 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 33 [2020-12-23 01:42:46,374 WARN L197 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 19 [2020-12-23 01:42:46,378 INFO L189 CegarLoopUtils]: For program point L531(lines 531 537) no Hoare annotation was computed. [2020-12-23 01:42:46,378 INFO L189 CegarLoopUtils]: For program point L498(lines 498 500) no Hoare annotation was computed. [2020-12-23 01:42:46,379 INFO L189 CegarLoopUtils]: For program point L531-1(lines 531 537) no Hoare annotation was computed. [2020-12-23 01:42:46,379 INFO L189 CegarLoopUtils]: For program point L498-2(lines 209 543) no Hoare annotation was computed. [2020-12-23 01:42:46,379 INFO L189 CegarLoopUtils]: For program point L202(lines 202 547) no Hoare annotation was computed. [2020-12-23 01:42:46,379 INFO L189 CegarLoopUtils]: For program point L169(lines 169 558) no Hoare annotation was computed. [2020-12-23 01:42:46,379 INFO L189 CegarLoopUtils]: For program point L136(lines 136 569) no Hoare annotation was computed. [2020-12-23 01:42:46,379 INFO L189 CegarLoopUtils]: For program point L103(lines 103 580) no Hoare annotation was computed. [2020-12-23 01:42:46,380 INFO L189 CegarLoopUtils]: For program point L434(lines 434 437) no Hoare annotation was computed. [2020-12-23 01:42:46,380 INFO L189 CegarLoopUtils]: For program point L335(lines 335 373) no Hoare annotation was computed. [2020-12-23 01:42:46,381 INFO L185 CegarLoopUtils]: At program point L203(lines 199 548) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4))) [2020-12-23 01:42:46,381 INFO L185 CegarLoopUtils]: At program point L104(lines 103 580) the Hoare annotation is: false [2020-12-23 01:42:46,381 INFO L192 CegarLoopUtils]: At program point L600(lines 99 601) the Hoare annotation is: true [2020-12-23 01:42:46,381 INFO L189 CegarLoopUtils]: For program point L534(lines 534 536) no Hoare annotation was computed. [2020-12-23 01:42:46,382 INFO L185 CegarLoopUtils]: At program point L402(lines 393 411) the Hoare annotation is: (let ((.cse0 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3))) [2020-12-23 01:42:46,382 INFO L189 CegarLoopUtils]: For program point L205(lines 205 546) no Hoare annotation was computed. [2020-12-23 01:42:46,382 INFO L189 CegarLoopUtils]: For program point L172(lines 172 557) no Hoare annotation was computed. [2020-12-23 01:42:46,382 INFO L189 CegarLoopUtils]: For program point L139(lines 139 568) no Hoare annotation was computed. [2020-12-23 01:42:46,382 INFO L189 CegarLoopUtils]: For program point L106(lines 106 579) no Hoare annotation was computed. [2020-12-23 01:42:46,382 INFO L189 CegarLoopUtils]: For program point L338(lines 338 372) no Hoare annotation was computed. [2020-12-23 01:42:46,382 INFO L189 CegarLoopUtils]: For program point L338-1(lines 338 372) no Hoare annotation was computed. [2020-12-23 01:42:46,383 INFO L185 CegarLoopUtils]: At program point L206(lines 205 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2020-12-23 01:42:46,383 INFO L185 CegarLoopUtils]: At program point L173(lines 169 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse5 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5))) [2020-12-23 01:42:46,383 INFO L185 CegarLoopUtils]: At program point L140(lines 136 569) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (<= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse8) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5 .cse6 .cse7 .cse8))) [2020-12-23 01:42:46,383 INFO L189 CegarLoopUtils]: For program point L471(lines 471 473) no Hoare annotation was computed. [2020-12-23 01:42:46,383 INFO L189 CegarLoopUtils]: For program point L405(lines 405 407) no Hoare annotation was computed. [2020-12-23 01:42:46,383 INFO L189 CegarLoopUtils]: For program point L339(lines 339 369) no Hoare annotation was computed. [2020-12-23 01:42:46,384 INFO L185 CegarLoopUtils]: At program point L208(lines 207 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2020-12-23 01:42:46,384 INFO L189 CegarLoopUtils]: For program point L175(lines 175 556) no Hoare annotation was computed. [2020-12-23 01:42:46,384 INFO L189 CegarLoopUtils]: For program point L142(lines 142 567) no Hoare annotation was computed. [2020-12-23 01:42:46,384 INFO L189 CegarLoopUtils]: For program point L109(lines 109 578) no Hoare annotation was computed. [2020-12-23 01:42:46,384 INFO L189 CegarLoopUtils]: For program point L605(lines 605 607) no Hoare annotation was computed. [2020-12-23 01:42:46,384 INFO L189 CegarLoopUtils]: For program point L605-2(lines 605 607) no Hoare annotation was computed. [2020-12-23 01:42:46,384 INFO L189 CegarLoopUtils]: For program point L506(lines 506 509) no Hoare annotation was computed. [2020-12-23 01:42:46,384 INFO L189 CegarLoopUtils]: For program point L275(lines 275 277) no Hoare annotation was computed. [2020-12-23 01:42:46,385 INFO L189 CegarLoopUtils]: For program point L275-2(lines 209 543) no Hoare annotation was computed. [2020-12-23 01:42:46,385 INFO L189 CegarLoopUtils]: For program point L309(lines 309 316) no Hoare annotation was computed. [2020-12-23 01:42:46,385 INFO L189 CegarLoopUtils]: For program point L309-2(lines 309 316) no Hoare annotation was computed. [2020-12-23 01:42:46,385 INFO L189 CegarLoopUtils]: For program point L244(lines 244 254) no Hoare annotation was computed. [2020-12-23 01:42:46,385 INFO L189 CegarLoopUtils]: For program point L178(lines 178 555) no Hoare annotation was computed. [2020-12-23 01:42:46,385 INFO L189 CegarLoopUtils]: For program point L145(lines 145 566) no Hoare annotation was computed. [2020-12-23 01:42:46,385 INFO L189 CegarLoopUtils]: For program point L112(lines 112 577) no Hoare annotation was computed. [2020-12-23 01:42:46,385 INFO L189 CegarLoopUtils]: For program point L344(lines 344 367) no Hoare annotation was computed. [2020-12-23 01:42:46,385 INFO L189 CegarLoopUtils]: For program point L245(lines 245 248) no Hoare annotation was computed. [2020-12-23 01:42:46,385 INFO L185 CegarLoopUtils]: At program point L212(lines 106 579) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse2 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-12-23 01:42:46,386 INFO L185 CegarLoopUtils]: At program point L179(lines 175 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse5 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5))) [2020-12-23 01:42:46,386 INFO L185 CegarLoopUtils]: At program point L146(lines 142 567) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5))) [2020-12-23 01:42:46,386 INFO L192 CegarLoopUtils]: At program point L610(lines 12 612) the Hoare annotation is: true [2020-12-23 01:42:46,387 INFO L185 CegarLoopUtils]: At program point L544(lines 100 599) the Hoare annotation is: (let ((.cse30 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse31 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse14 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse22 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse18 (not .cse14)) (.cse19 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not .cse31)) (.cse10 (not .cse30)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse15 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse17 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse12 .cse17 .cse18) (and .cse8 .cse5 .cse19 .cse18) (and .cse16 .cse20) (and .cse8 .cse0 .cse14 .cse2) (and .cse3 .cse12 .cse17) (and .cse1 .cse12 .cse17) (and .cse7 .cse21 .cse1 .cse22 .cse23 .cse11 .cse2 .cse24 .cse25) (and .cse26 .cse16 .cse24 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse18) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse27 .cse26 .cse14 .cse24) (and .cse8 .cse20) (and .cse0 .cse27 .cse4 .cse5 .cse6 .cse28) (and .cse27 .cse4 .cse5 .cse6 .cse28 .cse18) (and .cse8 .cse12 .cse17 .cse18) (and .cse8 .cse14 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse7 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse21 .cse22 .cse23 .cse11 .cse2 .cse24 .cse25) (and .cse7 .cse1 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse3 .cse2) (and .cse7 .cse3 .cse11 .cse29 .cse12 .cse15) (and .cse27 .cse5 .cse16 .cse19 .cse18) (and .cse8 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse14) (and .cse0 .cse8 .cse5 .cse19) (and .cse8 .cse14 .cse30) (and .cse7 .cse3 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse14 .cse31) (and .cse7 .cse1 .cse10 .cse11 .cse29 .cse12 .cse15) (and .cse4 .cse5 .cse1 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse14 .cse15) (and .cse0 .cse8 .cse12 .cse17)))) [2020-12-23 01:42:46,387 INFO L189 CegarLoopUtils]: For program point L445(lines 445 447) no Hoare annotation was computed. [2020-12-23 01:42:46,387 INFO L189 CegarLoopUtils]: For program point L313(lines 313 315) no Hoare annotation was computed. [2020-12-23 01:42:46,387 INFO L189 CegarLoopUtils]: For program point L181(lines 181 554) no Hoare annotation was computed. [2020-12-23 01:42:46,387 INFO L189 CegarLoopUtils]: For program point L148(lines 148 565) no Hoare annotation was computed. [2020-12-23 01:42:46,387 INFO L189 CegarLoopUtils]: For program point L115(lines 115 576) no Hoare annotation was computed. [2020-12-23 01:42:46,387 INFO L189 CegarLoopUtils]: For program point L347(lines 347 351) no Hoare annotation was computed. [2020-12-23 01:42:46,387 INFO L189 CegarLoopUtils]: For program point L347-2(lines 347 351) no Hoare annotation was computed. [2020-12-23 01:42:46,387 INFO L189 CegarLoopUtils]: For program point L83(lines 83 89) no Hoare annotation was computed. [2020-12-23 01:42:46,388 INFO L189 CegarLoopUtils]: For program point L480(lines 480 482) no Hoare annotation was computed. [2020-12-23 01:42:46,388 INFO L189 CegarLoopUtils]: For program point L381(lines 381 413) no Hoare annotation was computed. [2020-12-23 01:42:46,388 INFO L189 CegarLoopUtils]: For program point L514(lines 514 516) no Hoare annotation was computed. [2020-12-23 01:42:46,388 INFO L189 CegarLoopUtils]: For program point L448(lines 448 457) no Hoare annotation was computed. [2020-12-23 01:42:46,388 INFO L189 CegarLoopUtils]: For program point L382(lines 382 388) no Hoare annotation was computed. [2020-12-23 01:42:46,388 INFO L189 CegarLoopUtils]: For program point L217(lines 217 219) no Hoare annotation was computed. [2020-12-23 01:42:46,388 INFO L189 CegarLoopUtils]: For program point L184(lines 184 553) no Hoare annotation was computed. [2020-12-23 01:42:46,388 INFO L189 CegarLoopUtils]: For program point L151(lines 151 564) no Hoare annotation was computed. [2020-12-23 01:42:46,388 INFO L189 CegarLoopUtils]: For program point L217-2(lines 217 219) no Hoare annotation was computed. [2020-12-23 01:42:46,388 INFO L189 CegarLoopUtils]: For program point L118(lines 118 575) no Hoare annotation was computed. [2020-12-23 01:42:46,389 INFO L189 CegarLoopUtils]: For program point L581(lines 581 597) no Hoare annotation was computed. [2020-12-23 01:42:46,389 INFO L185 CegarLoopUtils]: At program point L515(lines 73 611) the Hoare annotation is: false [2020-12-23 01:42:46,389 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 01:42:46,389 INFO L185 CegarLoopUtils]: At program point L185(lines 181 554) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0))) [2020-12-23 01:42:46,389 INFO L185 CegarLoopUtils]: At program point L152(lines 148 565) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5))) [2020-12-23 01:42:46,389 INFO L189 CegarLoopUtils]: For program point L86(lines 86 88) no Hoare annotation was computed. [2020-12-23 01:42:46,389 INFO L189 CegarLoopUtils]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2020-12-23 01:42:46,389 INFO L189 CegarLoopUtils]: For program point L582(lines 582 596) no Hoare annotation was computed. [2020-12-23 01:42:46,390 INFO L189 CegarLoopUtils]: For program point L483(lines 483 487) no Hoare annotation was computed. [2020-12-23 01:42:46,390 INFO L189 CegarLoopUtils]: For program point L483-2(lines 483 487) no Hoare annotation was computed. [2020-12-23 01:42:46,390 INFO L189 CegarLoopUtils]: For program point L583(lines 583 588) no Hoare annotation was computed. [2020-12-23 01:42:46,390 INFO L189 CegarLoopUtils]: For program point L517(lines 517 519) no Hoare annotation was computed. [2020-12-23 01:42:46,390 INFO L189 CegarLoopUtils]: For program point L583-2(lines 582 596) no Hoare annotation was computed. [2020-12-23 01:42:46,390 INFO L189 CegarLoopUtils]: For program point L187(lines 187 552) no Hoare annotation was computed. [2020-12-23 01:42:46,390 INFO L189 CegarLoopUtils]: For program point L154(lines 154 563) no Hoare annotation was computed. [2020-12-23 01:42:46,390 INFO L189 CegarLoopUtils]: For program point L121(lines 121 574) no Hoare annotation was computed. [2020-12-23 01:42:46,390 INFO L189 CegarLoopUtils]: For program point L452(lines 452 454) no Hoare annotation was computed. [2020-12-23 01:42:46,391 INFO L185 CegarLoopUtils]: At program point L122(lines 118 575) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) [2020-12-23 01:42:46,391 INFO L189 CegarLoopUtils]: For program point L585(lines 585 587) no Hoare annotation was computed. [2020-12-23 01:42:46,391 INFO L189 CegarLoopUtils]: For program point L288(lines 288 294) no Hoare annotation was computed. [2020-12-23 01:42:46,391 INFO L189 CegarLoopUtils]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-12-23 01:42:46,391 INFO L189 CegarLoopUtils]: For program point L355(lines 355 363) no Hoare annotation was computed. [2020-12-23 01:42:46,391 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 01:42:46,391 INFO L189 CegarLoopUtils]: For program point L190(lines 190 551) no Hoare annotation was computed. [2020-12-23 01:42:46,391 INFO L189 CegarLoopUtils]: For program point L157(lines 157 562) no Hoare annotation was computed. [2020-12-23 01:42:46,391 INFO L189 CegarLoopUtils]: For program point L124(lines 124 573) no Hoare annotation was computed. [2020-12-23 01:42:46,391 INFO L189 CegarLoopUtils]: For program point L91(lines 91 95) no Hoare annotation was computed. [2020-12-23 01:42:46,391 INFO L189 CegarLoopUtils]: For program point L91-1(lines 73 611) no Hoare annotation was computed. [2020-12-23 01:42:46,392 INFO L189 CegarLoopUtils]: For program point L521(lines 521 525) no Hoare annotation was computed. [2020-12-23 01:42:46,392 INFO L189 CegarLoopUtils]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2020-12-23 01:42:46,392 INFO L185 CegarLoopUtils]: At program point L356(lines 332 374) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5))) [2020-12-23 01:42:46,392 INFO L185 CegarLoopUtils]: At program point L191(lines 187 552) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse0 .cse1) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1))) [2020-12-23 01:42:46,392 INFO L185 CegarLoopUtils]: At program point L158(lines 154 563) the Hoare annotation is: (let ((.cse0 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3))) [2020-12-23 01:42:46,393 INFO L185 CegarLoopUtils]: At program point L125(lines 124 573) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-23 01:42:46,393 INFO L189 CegarLoopUtils]: For program point L92(lines 92 94) no Hoare annotation was computed. [2020-12-23 01:42:46,393 INFO L189 CegarLoopUtils]: For program point L423(lines 423 425) no Hoare annotation was computed. [2020-12-23 01:42:46,393 INFO L185 CegarLoopUtils]: At program point L390(lines 381 413) the Hoare annotation is: (let ((.cse0 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3))) [2020-12-23 01:42:46,393 INFO L189 CegarLoopUtils]: For program point L291(lines 291 293) no Hoare annotation was computed. [2020-12-23 01:42:46,393 INFO L189 CegarLoopUtils]: For program point L291-2(lines 209 543) no Hoare annotation was computed. [2020-12-23 01:42:46,393 INFO L192 CegarLoopUtils]: At program point L622(lines 613 624) the Hoare annotation is: true [2020-12-23 01:42:46,393 INFO L189 CegarLoopUtils]: For program point L358(lines 358 360) no Hoare annotation was computed. [2020-12-23 01:42:46,394 INFO L189 CegarLoopUtils]: For program point L193(lines 193 550) no Hoare annotation was computed. [2020-12-23 01:42:46,394 INFO L189 CegarLoopUtils]: For program point L160(lines 160 561) no Hoare annotation was computed. [2020-12-23 01:42:46,394 INFO L189 CegarLoopUtils]: For program point L127(lines 127 572) no Hoare annotation was computed. [2020-12-23 01:42:46,394 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 01:42:46,394 INFO L189 CegarLoopUtils]: For program point L590(lines 590 594) no Hoare annotation was computed. [2020-12-23 01:42:46,394 INFO L189 CegarLoopUtils]: For program point L326(lines 326 330) no Hoare annotation was computed. [2020-12-23 01:42:46,394 INFO L189 CegarLoopUtils]: For program point L260(lines 260 262) no Hoare annotation was computed. [2020-12-23 01:42:46,394 INFO L189 CegarLoopUtils]: For program point L326-2(lines 209 543) no Hoare annotation was computed. [2020-12-23 01:42:46,394 INFO L189 CegarLoopUtils]: For program point L227(lines 227 238) no Hoare annotation was computed. [2020-12-23 01:42:46,394 INFO L189 CegarLoopUtils]: For program point L227-2(lines 209 543) no Hoare annotation was computed. [2020-12-23 01:42:46,394 INFO L189 CegarLoopUtils]: For program point L393(lines 393 411) no Hoare annotation was computed. [2020-12-23 01:42:46,395 INFO L189 CegarLoopUtils]: For program point L493(lines 493 496) no Hoare annotation was computed. [2020-12-23 01:42:46,395 INFO L189 CegarLoopUtils]: For program point L394(lines 394 400) no Hoare annotation was computed. [2020-12-23 01:42:46,395 INFO L189 CegarLoopUtils]: For program point L229(lines 229 232) no Hoare annotation was computed. [2020-12-23 01:42:46,395 INFO L189 CegarLoopUtils]: For program point L196(lines 196 549) no Hoare annotation was computed. [2020-12-23 01:42:46,395 INFO L189 CegarLoopUtils]: For program point L163(lines 163 560) no Hoare annotation was computed. [2020-12-23 01:42:46,395 INFO L189 CegarLoopUtils]: For program point L130(lines 130 571) no Hoare annotation was computed. [2020-12-23 01:42:46,395 INFO L185 CegarLoopUtils]: At program point L197(lines 193 550) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse3 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse2 .cse5))) [2020-12-23 01:42:46,395 INFO L185 CegarLoopUtils]: At program point L164(lines 160 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse2 .cse3))) [2020-12-23 01:42:46,396 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 01:42:46,396 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 609) no Hoare annotation was computed. [2020-12-23 01:42:46,396 INFO L189 CegarLoopUtils]: For program point L462(lines 462 464) no Hoare annotation was computed. [2020-12-23 01:42:46,396 INFO L189 CegarLoopUtils]: For program point L298(lines 298 302) no Hoare annotation was computed. [2020-12-23 01:42:46,396 INFO L189 CegarLoopUtils]: For program point L298-2(lines 298 302) no Hoare annotation was computed. [2020-12-23 01:42:46,396 INFO L189 CegarLoopUtils]: For program point L199(lines 199 548) no Hoare annotation was computed. [2020-12-23 01:42:46,396 INFO L189 CegarLoopUtils]: For program point L166(lines 166 559) no Hoare annotation was computed. [2020-12-23 01:42:46,396 INFO L189 CegarLoopUtils]: For program point L133(lines 133 570) no Hoare annotation was computed. [2020-12-23 01:42:46,397 INFO L185 CegarLoopUtils]: At program point L100-2(lines 100 599) the Hoare annotation is: (let ((.cse30 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse31 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse14 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse22 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse18 (not .cse14)) (.cse19 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not .cse31)) (.cse10 (not .cse30)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse15 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse17 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse12 .cse17 .cse18) (and .cse8 .cse5 .cse19 .cse18) (and .cse16 .cse20) (and .cse8 .cse0 .cse14 .cse2) (and .cse3 .cse12 .cse17) (and .cse1 .cse12 .cse17) (and .cse7 .cse21 .cse1 .cse22 .cse23 .cse11 .cse2 .cse24 .cse25) (and .cse26 .cse16 .cse24 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse18) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse27 .cse26 .cse14 .cse24) (and .cse8 .cse20) (and .cse0 .cse27 .cse4 .cse5 .cse6 .cse28) (and .cse27 .cse4 .cse5 .cse6 .cse28 .cse18) (and .cse8 .cse12 .cse17 .cse18) (and .cse8 .cse14 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse7 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse21 .cse22 .cse23 .cse11 .cse2 .cse24 .cse25) (and .cse7 .cse1 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse3 .cse2) (and .cse7 .cse3 .cse11 .cse29 .cse12 .cse15) (and .cse27 .cse5 .cse16 .cse19 .cse18) (and .cse8 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse14) (and .cse0 .cse8 .cse5 .cse19) (and .cse8 .cse14 .cse30) (and .cse7 .cse3 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse14 .cse31) (and .cse7 .cse1 .cse10 .cse11 .cse29 .cse12 .cse15) (and .cse4 .cse5 .cse1 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse14 .cse15) (and .cse0 .cse8 .cse12 .cse17)))) [2020-12-23 01:42:46,397 INFO L189 CegarLoopUtils]: For program point L431-1(lines 431 439) no Hoare annotation was computed. [2020-12-23 01:42:46,397 INFO L189 CegarLoopUtils]: For program point L233(lines 233 236) no Hoare annotation was computed. [2020-12-23 01:42:46,397 INFO L185 CegarLoopUtils]: At program point L167(lines 166 559) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (not .cse3)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse3 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse3 .cse2))) [2020-12-23 01:42:46,398 INFO L185 CegarLoopUtils]: At program point L134(lines 127 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10))) [2020-12-23 01:42:46,398 INFO L189 CegarLoopUtils]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-23 01:42:46,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:42:46 BoogieIcfgContainer [2020-12-23 01:42:46,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:42:46,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:42:46,452 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:42:46,452 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:42:46,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:57" (3/4) ... [2020-12-23 01:42:46,456 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 01:42:46,477 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-23 01:42:46,478 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-23 01:42:46,479 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 01:42:46,480 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 01:42:46,602 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_srvr_2.cil-1.c-witness.graphml [2020-12-23 01:42:46,602 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:42:46,603 INFO L168 Benchmark]: Toolchain (without parser) took 51389.20 ms. Allocated memory was 153.1 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 107.9 MB in the beginning and 1.1 GB in the end (delta: -993.0 MB). Peak memory consumption was 27.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:46,603 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 153.1 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:42:46,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.28 ms. Allocated memory is still 153.1 MB. Free memory was 107.9 MB in the beginning and 92.7 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:46,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.47 ms. Allocated memory is still 153.1 MB. Free memory was 92.7 MB in the beginning and 134.6 MB in the end (delta: -41.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:46,604 INFO L168 Benchmark]: Boogie Preprocessor took 65.87 ms. Allocated memory is still 153.1 MB. Free memory was 134.6 MB in the beginning and 133.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:46,605 INFO L168 Benchmark]: RCFGBuilder took 1077.46 ms. Allocated memory is still 153.1 MB. Free memory was 133.2 MB in the beginning and 81.8 MB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:46,605 INFO L168 Benchmark]: TraceAbstraction took 49443.74 ms. Allocated memory was 153.1 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 81.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 656.0 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:46,606 INFO L168 Benchmark]: Witness Printer took 150.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:46,608 INFO L339 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 153.1 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 524.28 ms. Allocated memory is still 153.1 MB. Free memory was 107.9 MB in the beginning and 92.7 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 114.47 ms. Allocated memory is still 153.1 MB. Free memory was 92.7 MB in the beginning and 134.6 MB in the end (delta: -41.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 65.87 ms. Allocated memory is still 153.1 MB. Free memory was 134.6 MB in the beginning and 133.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1077.46 ms. Allocated memory is still 153.1 MB. Free memory was 133.2 MB in the beginning and 81.8 MB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 49443.74 ms. Allocated memory was 153.1 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 81.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 656.0 MB. Max. memory is 8.0 GB. * Witness Printer took 150.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 609]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__hit == 0) && s__state <= 8576) && 8512 <= s__state) || ((((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && 8480 <= s__state) && !(s__state == 8544)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && blastFlag == 0) && 8480 <= s__state) && !(s__state == 8544)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576)) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(8496 == s__state)) && 8480 <= s__state) && !(s__state == 8544)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8673) && blastFlag <= 3) && s__state <= 8672) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(12292 == s__state)) && !(s__state == 8672)) && !(s__hit == 0)) || ((((!(s__state == 8673) && s__state <= 8672) && 8656 <= s__state) && blastFlag == 1) && !(s__state == 8672))) || (((((((blastFlag <= 2 && !(s__state == 8673)) && blastFlag <= 3) && s__state <= 8672) && 8656 <= s__state) && !(12292 == s__state)) && !(s__state == 8672)) && !(s__hit == 0))) || (((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8673)) && blastFlag <= 3) && s__state <= 8672) && 8656 <= s__state) && !(12292 == s__state)) && !(s__state == 8672))) || ((((!(s__state == 8673) && blastFlag == 0) && 8656 <= s__state) && s__state <= 8672) && !(s__state == 8672)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__hit == 0) && s__state <= 8576) && 8512 <= s__state) || ((((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576) || (((blastFlag == 0 && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657))) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && s__hit == 0) && 8512 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 8656 <= s__state) && s__state <= 8656) && !(s__hit == 0))) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__hit == 0) && s__state <= 8576)) || ((blastFlag == 0 && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || (blastFlag <= 2 && s__state <= 3)) || (((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8656))) || (((((blastFlag <= 3 && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8656)) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((((!(s__state == 8545) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && 8512 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && 8512 <= s__state)) || ((((blastFlag <= 3 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8656) && !(s__hit == 0))) || ((blastFlag <= 2 && s__state == 8528) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && 8656 <= s__state) && s__state <= 8656)) || ((blastFlag <= 2 && s__hit == 0) && 8560 == s__state)) || (((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && 8512 <= s__state)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8544)) || ((((((!(s__state == 8545) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && 8512 <= s__state)) || (((s__state <= 8672 && 8656 <= s__state) && blastFlag == 1) && !(s__state == 8657))) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && s__hit == 0) && 8512 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state <= 8640) && 8640 <= s__state) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8512 <= s__state) || ((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__hit == 0) && 8512 <= s__state)) || ((((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8512 <= s__state) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) || ((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8545)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag == 0 && s__state <= 8640) && 8640 <= s__state) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) && 8512 <= s__state) || ((((blastFlag == 1 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((blastFlag == 0 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8545)) && 8480 <= s__state) && !(s__state == 8480)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) && !(s__state == 8481)) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag == 0) && 8480 <= s__state) && !(s__state == 8480)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481))) || ((((((((!(s__state == 8545) && 8480 <= s__state) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576) || (((blastFlag == 0 && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657))) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && s__hit == 0) && 8512 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 8656 <= s__state) && s__state <= 8656) && !(s__hit == 0))) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__hit == 0) && s__state <= 8576)) || ((blastFlag == 0 && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || (blastFlag <= 2 && s__state <= 3)) || (((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8656))) || (((((blastFlag <= 3 && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8656)) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((((!(s__state == 8545) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && 8512 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && 8512 <= s__state)) || ((((blastFlag <= 3 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8656) && !(s__hit == 0))) || ((blastFlag <= 2 && s__state == 8528) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && 8656 <= s__state) && s__state <= 8656)) || ((blastFlag <= 2 && s__hit == 0) && 8560 == s__state)) || (((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && 8512 <= s__state)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8544)) || ((((((!(s__state == 8545) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && 8512 <= s__state)) || (((s__state <= 8672 && 8656 <= s__state) && blastFlag == 1) && !(s__state == 8657))) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && s__hit == 0) && 8512 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state <= 8640) && 8640 <= s__state) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8512 <= s__state) || ((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__hit == 0) && 8512 <= s__state)) || ((((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8512 <= s__state) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && s__state <= 8576) && 8512 <= s__state) || ((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && s__state <= 8576) && 8512 <= s__state)) || (((((!(s__state == 8545) && blastFlag <= 2) && !(s__state == 8544)) && s__hit == 0) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || (((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && blastFlag == 1) && 8448 <= s__state) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8448) && 8448 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8545) && !(8496 == s__state)) && 8480 <= s__state) && !(s__state == 8480)) && !(s__state == 8544)) && s__s3__tmp__next_state___0 <= 8640) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && !(s__state == 8481)) || ((((((((((!(s__state == 8545) && blastFlag <= 2) && !(8496 == s__state)) && 8480 <= s__state) && !(s__state == 8480)) && !(s__state == 8544)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && !(s__state == 8481)) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) && 8512 <= s__state) || ((((blastFlag == 1 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((blastFlag == 0 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8656 <= s__state) && !(s__state == 8657)) && !(12292 == s__state)) && !(s__state == 8656)) || (((((blastFlag <= 3 && 8656 <= s__state) && !(s__state == 8657)) && !(12292 == s__state)) && !(s__state == 8656)) && !(s__hit == 0))) || ((((8656 <= s__state && blastFlag == 1) && !(s__state == 8657)) && !(12292 == s__state)) && !(s__state == 8656))) || ((((blastFlag == 0 && 8656 <= s__state) && !(s__state == 8657)) && !(12292 == s__state)) && !(s__state == 8656)) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) && 8512 <= s__state) || ((((blastFlag == 1 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((blastFlag == 0 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__hit == 0) && s__state <= 8576) && 8512 <= s__state) || ((((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state == 8608) && s__hit == 0) || (blastFlag == 0 && s__state == 8608)) || (blastFlag == 1 && s__state == 8608) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 25.1s, OverallIterations: 39, TraceHistogramMax: 24, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7382 SDtfs, 4553 SDslu, 3427 SDs, 0 SdLazy, 3933 SolverSat, 1076 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3121 GetRequests, 3066 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5055occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 6779 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 260 NumberOfFragments, 2695 HoareAnnotationTreeSize, 28 FomulaSimplifications, 471743 FormulaSimplificationTreeSizeReduction, 3.9s HoareSimplificationTime, 28 FomulaSimplificationsInter, 65500 FormulaSimplificationTreeSizeReductionInter, 20.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 11577 NumberOfCodeBlocks, 11577 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 11530 ConstructedInterpolants, 0 QuantifiedInterpolants, 5297671 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5044 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 47 InterpolantComputations, 35 PerfectInterpolantSequences, 44574/44754 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...