/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_13.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:41:41,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:41:41,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:41:41,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:41:41,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:41:41,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:41:41,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:41:41,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:41:41,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:41:41,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:41:41,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:41:41,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:41:41,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:41:41,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:41:41,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:41:41,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:41:41,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:41:41,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:41:41,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:41:41,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:41:41,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:41:41,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:41:41,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:41:41,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:41:41,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:41:41,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:41:41,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:41:41,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:41:41,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:41:41,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:41:41,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:41:41,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:41:41,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:41:41,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:41:41,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:41:41,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:41:41,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:41:41,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:41:41,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:41:41,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:41:41,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:41:41,486 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:41,532 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:41:41,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:41:41,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:41:41,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:41:41,537 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:41:41,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:41:41,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:41:41,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:41:41,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:41:41,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:41:41,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:41:41,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:41:41,540 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:41:41,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:41:41,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:41:41,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:41:41,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:41:41,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:41:41,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:41:41,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:41:41,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:41:41,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:41:41,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:41:41,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:41:41,542 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:41:41,543 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:41,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:41:42,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:41:42,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:41:42,015 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:41:42,016 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:41:42,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_13.cil.c [2020-12-23 01:41:42,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/36253ae79/df50c21cdcc04c96934c3d9f12e22e0c/FLAG63b2b585c [2020-12-23 01:41:42,795 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:41:42,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_13.cil.c [2020-12-23 01:41:42,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/36253ae79/df50c21cdcc04c96934c3d9f12e22e0c/FLAG63b2b585c [2020-12-23 01:41:43,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/36253ae79/df50c21cdcc04c96934c3d9f12e22e0c [2020-12-23 01:41:43,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:41:43,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:41:43,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:41:43,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:41:43,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:41:43,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ab5274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43, skipping insertion in model container [2020-12-23 01:41:43,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:41:43,193 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[~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__s3__tmp__new_cipher__algorithms~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[~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[~s__s3__tmp__new_cipher__algorithms~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[~s__s3__tmp__new_cipher__algo_strength~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__new_cipher__algo_strength~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[~blastFlag~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[~s__s3__tmp__new_cipher__algorithms~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[~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__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[~blastFlag~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[~s__s3__tmp__reuse_message~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:43,463 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_13.cil.c[44554,44567] 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:43,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:41:43,502 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[~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__s3__tmp__new_cipher__algorithms~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[~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[~s__s3__tmp__new_cipher__algorithms~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[~s__s3__tmp__new_cipher__algo_strength~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__new_cipher__algo_strength~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[~blastFlag~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[~s__s3__tmp__new_cipher__algorithms~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[~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__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[~blastFlag~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[~s__s3__tmp__reuse_message~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:43,573 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_13.cil.c[44554,44567] 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:43,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:41:43,598 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:41:43,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43 WrapperNode [2020-12-23 01:41:43,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:41:43,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:41:43,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:41:43,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:41:43,611 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:43" (1/1) ... [2020-12-23 01:41:43,623 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:43" (1/1) ... [2020-12-23 01:41:43,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:41:43,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:41:43,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:41:43,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:41:43,685 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:43" (1/1) ... [2020-12-23 01:41:43,685 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:43" (1/1) ... [2020-12-23 01:41:43,691 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:43" (1/1) ... [2020-12-23 01:41:43,691 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:43" (1/1) ... [2020-12-23 01:41:43,701 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:43" (1/1) ... [2020-12-23 01:41:43,710 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:43" (1/1) ... [2020-12-23 01:41:43,714 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:43" (1/1) ... [2020-12-23 01:41:43,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:41:43,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:41:43,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:41:43,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:41:43,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (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:43,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:41:43,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:41:43,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:41:43,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:41:43,998 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:41:44,840 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2020-12-23 01:41:44,840 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2020-12-23 01:41:44,852 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:41:44,852 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:41:44,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:44 BoogieIcfgContainer [2020-12-23 01:41:44,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:41:44,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:41:44,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:41:44,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:41:44,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:41:43" (1/3) ... [2020-12-23 01:41:44,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12433430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:41:44, skipping insertion in model container [2020-12-23 01:41:44,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (2/3) ... [2020-12-23 01:41:44,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12433430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:41:44, skipping insertion in model container [2020-12-23 01:41:44,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:44" (3/3) ... [2020-12-23 01:41:44,865 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2020-12-23 01:41:44,873 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:41:44,879 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:41:44,900 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:41:44,932 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:41:44,932 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:41:44,932 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:41:44,932 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:41:44,933 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:41:44,933 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:41:44,933 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:41:44,933 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:41:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2020-12-23 01:41:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 01:41:44,963 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:44,964 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] [2020-12-23 01:41:44,965 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:44,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash -651780530, now seen corresponding path program 1 times [2020-12-23 01:41:44,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:44,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273029697] [2020-12-23 01:41:44,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:45,234 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:45,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273029697] [2020-12-23 01:41:45,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:45,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:45,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980377100] [2020-12-23 01:41:45,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:45,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:45,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:45,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:45,261 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 3 states. [2020-12-23 01:41:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:45,557 INFO L93 Difference]: Finished difference Result 325 states and 557 transitions. [2020-12-23 01:41:45,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:45,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-12-23 01:41:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:45,572 INFO L225 Difference]: With dead ends: 325 [2020-12-23 01:41:45,572 INFO L226 Difference]: Without dead ends: 160 [2020-12-23 01:41:45,577 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:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-23 01:41:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2020-12-23 01:41:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-12-23 01:41:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 249 transitions. [2020-12-23 01:41:45,634 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 249 transitions. Word has length 26 [2020-12-23 01:41:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:45,635 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 249 transitions. [2020-12-23 01:41:45,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 249 transitions. [2020-12-23 01:41:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:41:45,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:45,637 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] [2020-12-23 01:41:45,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:41:45,638 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:45,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash 490720896, now seen corresponding path program 1 times [2020-12-23 01:41:45,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:45,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902211781] [2020-12-23 01:41:45,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:45,760 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:45,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902211781] [2020-12-23 01:41:45,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:45,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:45,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541695041] [2020-12-23 01:41:45,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:45,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:45,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:45,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:45,765 INFO L87 Difference]: Start difference. First operand 158 states and 249 transitions. Second operand 3 states. [2020-12-23 01:41:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:45,938 INFO L93 Difference]: Finished difference Result 330 states and 519 transitions. [2020-12-23 01:41:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:45,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 01:41:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:45,941 INFO L225 Difference]: With dead ends: 330 [2020-12-23 01:41:45,941 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 01:41:45,943 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:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 01:41:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2020-12-23 01:41:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-12-23 01:41:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2020-12-23 01:41:45,963 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 27 [2020-12-23 01:41:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:45,963 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2020-12-23 01:41:45,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2020-12-23 01:41:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:41:45,964 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:45,965 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] [2020-12-23 01:41:45,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:41:45,965 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:45,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1046842997, now seen corresponding path program 1 times [2020-12-23 01:41:45,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:45,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015936845] [2020-12-23 01:41:45,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:46,032 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:46,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015936845] [2020-12-23 01:41:46,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:46,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:46,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683770397] [2020-12-23 01:41:46,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:46,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:46,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,035 INFO L87 Difference]: Start difference. First operand 180 states and 279 transitions. Second operand 3 states. [2020-12-23 01:41:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:46,187 INFO L93 Difference]: Finished difference Result 360 states and 560 transitions. [2020-12-23 01:41:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:46,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 01:41:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:46,191 INFO L225 Difference]: With dead ends: 360 [2020-12-23 01:41:46,192 INFO L226 Difference]: Without dead ends: 188 [2020-12-23 01:41:46,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:41:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-23 01:41:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2020-12-23 01:41:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-12-23 01:41:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2020-12-23 01:41:46,234 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 27 [2020-12-23 01:41:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:46,235 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2020-12-23 01:41:46,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2020-12-23 01:41:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:41:46,238 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:46,239 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] [2020-12-23 01:41:46,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:41:46,239 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:46,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:46,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1631613131, now seen corresponding path program 1 times [2020-12-23 01:41:46,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:46,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884832070] [2020-12-23 01:41:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:46,340 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:46,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884832070] [2020-12-23 01:41:46,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:46,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:46,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305011442] [2020-12-23 01:41:46,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:46,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:46,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:46,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,348 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand 3 states. [2020-12-23 01:41:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:46,509 INFO L93 Difference]: Finished difference Result 365 states and 570 transitions. [2020-12-23 01:41:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:46,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 01:41:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:46,512 INFO L225 Difference]: With dead ends: 365 [2020-12-23 01:41:46,512 INFO L226 Difference]: Without dead ends: 187 [2020-12-23 01:41:46,515 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:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-12-23 01:41:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2020-12-23 01:41:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 01:41:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 291 transitions. [2020-12-23 01:41:46,536 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 291 transitions. Word has length 27 [2020-12-23 01:41:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:46,536 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 291 transitions. [2020-12-23 01:41:46,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 291 transitions. [2020-12-23 01:41:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 01:41:46,543 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:46,544 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] [2020-12-23 01:41:46,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:41:46,544 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:46,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash -431278894, now seen corresponding path program 1 times [2020-12-23 01:41:46,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:46,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411001895] [2020-12-23 01:41:46,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:46,650 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:46,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411001895] [2020-12-23 01:41:46,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:46,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:46,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131836533] [2020-12-23 01:41:46,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:46,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:46,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:46,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,654 INFO L87 Difference]: Start difference. First operand 187 states and 291 transitions. Second operand 3 states. [2020-12-23 01:41:46,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:46,801 INFO L93 Difference]: Finished difference Result 376 states and 582 transitions. [2020-12-23 01:41:46,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:46,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-23 01:41:46,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:46,803 INFO L225 Difference]: With dead ends: 376 [2020-12-23 01:41:46,803 INFO L226 Difference]: Without dead ends: 197 [2020-12-23 01:41:46,804 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:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-12-23 01:41:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2020-12-23 01:41:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 01:41:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 289 transitions. [2020-12-23 01:41:46,814 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 289 transitions. Word has length 28 [2020-12-23 01:41:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:46,814 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 289 transitions. [2020-12-23 01:41:46,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 289 transitions. [2020-12-23 01:41:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:41:46,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:46,815 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] [2020-12-23 01:41:46,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:41:46,816 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:46,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1682017785, now seen corresponding path program 1 times [2020-12-23 01:41:46,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:46,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205933420] [2020-12-23 01:41:46,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:46,853 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:46,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205933420] [2020-12-23 01:41:46,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:46,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:46,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911609401] [2020-12-23 01:41:46,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:46,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:46,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:46,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,856 INFO L87 Difference]: Start difference. First operand 187 states and 289 transitions. Second operand 3 states. [2020-12-23 01:41:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,012 INFO L93 Difference]: Finished difference Result 376 states and 578 transitions. [2020-12-23 01:41:47,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-12-23 01:41:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,015 INFO L225 Difference]: With dead ends: 376 [2020-12-23 01:41:47,015 INFO L226 Difference]: Without dead ends: 197 [2020-12-23 01:41:47,016 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:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-12-23 01:41:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2020-12-23 01:41:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 01:41:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 287 transitions. [2020-12-23 01:41:47,025 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 287 transitions. Word has length 29 [2020-12-23 01:41:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,025 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 287 transitions. [2020-12-23 01:41:47,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 287 transitions. [2020-12-23 01:41:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 01:41:47,026 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,026 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] [2020-12-23 01:41:47,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:41:47,026 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1452653961, now seen corresponding path program 1 times [2020-12-23 01:41:47,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127011030] [2020-12-23 01:41:47,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,061 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:47,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127011030] [2020-12-23 01:41:47,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:47,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892866264] [2020-12-23 01:41:47,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:47,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:47,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,064 INFO L87 Difference]: Start difference. First operand 187 states and 287 transitions. Second operand 3 states. [2020-12-23 01:41:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,226 INFO L93 Difference]: Finished difference Result 376 states and 574 transitions. [2020-12-23 01:41:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-12-23 01:41:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,228 INFO L225 Difference]: With dead ends: 376 [2020-12-23 01:41:47,228 INFO L226 Difference]: Without dead ends: 197 [2020-12-23 01:41:47,229 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:47,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-12-23 01:41:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2020-12-23 01:41:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 01:41:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 285 transitions. [2020-12-23 01:41:47,238 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 285 transitions. Word has length 30 [2020-12-23 01:41:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,238 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 285 transitions. [2020-12-23 01:41:47,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 285 transitions. [2020-12-23 01:41:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 01:41:47,239 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,240 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] [2020-12-23 01:41:47,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:41:47,240 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1026970664, now seen corresponding path program 1 times [2020-12-23 01:41:47,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788511689] [2020-12-23 01:41:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,296 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:47,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788511689] [2020-12-23 01:41:47,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:41:47,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087371411] [2020-12-23 01:41:47,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:41:47,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:41:47,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:41:47,299 INFO L87 Difference]: Start difference. First operand 187 states and 285 transitions. Second operand 4 states. [2020-12-23 01:41:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,597 INFO L93 Difference]: Finished difference Result 572 states and 871 transitions. [2020-12-23 01:41:47,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:41:47,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-12-23 01:41:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,600 INFO L225 Difference]: With dead ends: 572 [2020-12-23 01:41:47,600 INFO L226 Difference]: Without dead ends: 393 [2020-12-23 01:41:47,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:47,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-12-23 01:41:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 357. [2020-12-23 01:41:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-12-23 01:41:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 543 transitions. [2020-12-23 01:41:47,621 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 543 transitions. Word has length 30 [2020-12-23 01:41:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,622 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 543 transitions. [2020-12-23 01:41:47,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:41:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 543 transitions. [2020-12-23 01:41:47,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 01:41:47,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,623 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] [2020-12-23 01:41:47,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:41:47,624 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1801233473, now seen corresponding path program 1 times [2020-12-23 01:41:47,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537924284] [2020-12-23 01:41:47,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,666 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:47,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537924284] [2020-12-23 01:41:47,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:47,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796399582] [2020-12-23 01:41:47,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:47,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,669 INFO L87 Difference]: Start difference. First operand 357 states and 543 transitions. Second operand 3 states. [2020-12-23 01:41:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,859 INFO L93 Difference]: Finished difference Result 781 states and 1197 transitions. [2020-12-23 01:41:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-12-23 01:41:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,863 INFO L225 Difference]: With dead ends: 781 [2020-12-23 01:41:47,863 INFO L226 Difference]: Without dead ends: 432 [2020-12-23 01:41:47,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:41:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-12-23 01:41:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 412. [2020-12-23 01:41:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-12-23 01:41:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 630 transitions. [2020-12-23 01:41:47,884 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 630 transitions. Word has length 33 [2020-12-23 01:41:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,885 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 630 transitions. [2020-12-23 01:41:47,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 630 transitions. [2020-12-23 01:41:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 01:41:47,885 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,886 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] [2020-12-23 01:41:47,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:41:47,886 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,887 INFO L82 PathProgramCache]: Analyzing trace with hash -979083784, now seen corresponding path program 1 times [2020-12-23 01:41:47,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066622601] [2020-12-23 01:41:47,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,934 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:47,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066622601] [2020-12-23 01:41:47,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:47,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218142131] [2020-12-23 01:41:47,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:47,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:47,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,937 INFO L87 Difference]: Start difference. First operand 412 states and 630 transitions. Second operand 3 states. [2020-12-23 01:41:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:48,128 INFO L93 Difference]: Finished difference Result 858 states and 1321 transitions. [2020-12-23 01:41:48,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:48,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-12-23 01:41:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:48,134 INFO L225 Difference]: With dead ends: 858 [2020-12-23 01:41:48,134 INFO L226 Difference]: Without dead ends: 454 [2020-12-23 01:41:48,136 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:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2020-12-23 01:41:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2020-12-23 01:41:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-23 01:41:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 670 transitions. [2020-12-23 01:41:48,159 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 670 transitions. Word has length 34 [2020-12-23 01:41:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:48,161 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 670 transitions. [2020-12-23 01:41:48,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 670 transitions. [2020-12-23 01:41:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 01:41:48,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:48,163 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] [2020-12-23 01:41:48,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:41:48,163 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:48,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:48,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1380253332, now seen corresponding path program 1 times [2020-12-23 01:41:48,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:48,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424579436] [2020-12-23 01:41:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:48,214 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:48,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424579436] [2020-12-23 01:41:48,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:48,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:48,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982641904] [2020-12-23 01:41:48,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:48,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:48,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:48,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,218 INFO L87 Difference]: Start difference. First operand 434 states and 670 transitions. Second operand 3 states. [2020-12-23 01:41:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:48,420 INFO L93 Difference]: Finished difference Result 925 states and 1433 transitions. [2020-12-23 01:41:48,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:48,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-12-23 01:41:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:48,424 INFO L225 Difference]: With dead ends: 925 [2020-12-23 01:41:48,425 INFO L226 Difference]: Without dead ends: 499 [2020-12-23 01:41:48,426 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:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2020-12-23 01:41:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 489. [2020-12-23 01:41:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2020-12-23 01:41:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 760 transitions. [2020-12-23 01:41:48,448 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 760 transitions. Word has length 40 [2020-12-23 01:41:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:48,449 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 760 transitions. [2020-12-23 01:41:48,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 760 transitions. [2020-12-23 01:41:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 01:41:48,450 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:48,450 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] [2020-12-23 01:41:48,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:41:48,450 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:48,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -168828106, now seen corresponding path program 1 times [2020-12-23 01:41:48,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:48,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793286535] [2020-12-23 01:41:48,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:48,510 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:48,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793286535] [2020-12-23 01:41:48,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:48,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:48,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300191390] [2020-12-23 01:41:48,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:48,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:48,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:48,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,512 INFO L87 Difference]: Start difference. First operand 489 states and 760 transitions. Second operand 3 states. [2020-12-23 01:41:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:48,719 INFO L93 Difference]: Finished difference Result 992 states and 1545 transitions. [2020-12-23 01:41:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:48,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-12-23 01:41:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:48,723 INFO L225 Difference]: With dead ends: 992 [2020-12-23 01:41:48,723 INFO L226 Difference]: Without dead ends: 511 [2020-12-23 01:41:48,724 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:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-12-23 01:41:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 501. [2020-12-23 01:41:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2020-12-23 01:41:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 782 transitions. [2020-12-23 01:41:48,748 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 782 transitions. Word has length 41 [2020-12-23 01:41:48,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:48,748 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 782 transitions. [2020-12-23 01:41:48,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 782 transitions. [2020-12-23 01:41:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 01:41:48,750 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:48,750 INFO L422 BasicCegarLoop]: trace histogram [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:41:48,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:41:48,750 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:48,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:48,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2051620392, now seen corresponding path program 1 times [2020-12-23 01:41:48,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:48,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766494103] [2020-12-23 01:41:48,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:48,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766494103] [2020-12-23 01:41:48,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:48,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:48,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299592076] [2020-12-23 01:41:48,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:48,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:48,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:48,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,820 INFO L87 Difference]: Start difference. First operand 501 states and 782 transitions. Second operand 3 states. [2020-12-23 01:41:48,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:48,984 INFO L93 Difference]: Finished difference Result 1008 states and 1575 transitions. [2020-12-23 01:41:48,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:48,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 01:41:48,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:48,988 INFO L225 Difference]: With dead ends: 1008 [2020-12-23 01:41:48,988 INFO L226 Difference]: Without dead ends: 515 [2020-12-23 01:41:48,989 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:48,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2020-12-23 01:41:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 501. [2020-12-23 01:41:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2020-12-23 01:41:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 778 transitions. [2020-12-23 01:41:49,013 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 778 transitions. Word has length 61 [2020-12-23 01:41:49,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:49,013 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 778 transitions. [2020-12-23 01:41:49,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 778 transitions. [2020-12-23 01:41:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 01:41:49,015 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:49,015 INFO L422 BasicCegarLoop]: trace histogram [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:41:49,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:41:49,015 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:49,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:49,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1852313784, now seen corresponding path program 1 times [2020-12-23 01:41:49,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:49,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930687750] [2020-12-23 01:41:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:49,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930687750] [2020-12-23 01:41:49,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423465267] [2020-12-23 01:41:49,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,053 INFO L87 Difference]: Start difference. First operand 501 states and 778 transitions. Second operand 3 states. [2020-12-23 01:41:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:49,248 INFO L93 Difference]: Finished difference Result 1032 states and 1601 transitions. [2020-12-23 01:41:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:49,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-12-23 01:41:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:49,251 INFO L225 Difference]: With dead ends: 1032 [2020-12-23 01:41:49,251 INFO L226 Difference]: Without dead ends: 539 [2020-12-23 01:41:49,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:41:49,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-12-23 01:41:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2020-12-23 01:41:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2020-12-23 01:41:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 832 transitions. [2020-12-23 01:41:49,278 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 832 transitions. Word has length 62 [2020-12-23 01:41:49,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:49,278 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 832 transitions. [2020-12-23 01:41:49,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 832 transitions. [2020-12-23 01:41:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 01:41:49,280 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:49,280 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:41:49,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:41:49,280 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:49,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:49,281 INFO L82 PathProgramCache]: Analyzing trace with hash 932372046, now seen corresponding path program 1 times [2020-12-23 01:41:49,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:49,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383063714] [2020-12-23 01:41:49,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 01:41:49,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383063714] [2020-12-23 01:41:49,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232239768] [2020-12-23 01:41:49,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,315 INFO L87 Difference]: Start difference. First operand 539 states and 832 transitions. Second operand 3 states. [2020-12-23 01:41:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:49,480 INFO L93 Difference]: Finished difference Result 1112 states and 1713 transitions. [2020-12-23 01:41:49,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:49,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-12-23 01:41:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:49,483 INFO L225 Difference]: With dead ends: 1112 [2020-12-23 01:41:49,484 INFO L226 Difference]: Without dead ends: 581 [2020-12-23 01:41:49,485 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:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-12-23 01:41:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 571. [2020-12-23 01:41:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2020-12-23 01:41:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 874 transitions. [2020-12-23 01:41:49,511 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 874 transitions. Word has length 62 [2020-12-23 01:41:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:49,511 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 874 transitions. [2020-12-23 01:41:49,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 874 transitions. [2020-12-23 01:41:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 01:41:49,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:49,513 INFO L422 BasicCegarLoop]: trace histogram [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:41:49,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:41:49,513 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:49,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:49,514 INFO L82 PathProgramCache]: Analyzing trace with hash -394487435, now seen corresponding path program 1 times [2020-12-23 01:41:49,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:49,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28294098] [2020-12-23 01:41:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 01:41:49,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28294098] [2020-12-23 01:41:49,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281357143] [2020-12-23 01:41:49,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,548 INFO L87 Difference]: Start difference. First operand 571 states and 874 transitions. Second operand 3 states. [2020-12-23 01:41:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:49,737 INFO L93 Difference]: Finished difference Result 1144 states and 1750 transitions. [2020-12-23 01:41:49,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:49,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-12-23 01:41:49,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:49,741 INFO L225 Difference]: With dead ends: 1144 [2020-12-23 01:41:49,741 INFO L226 Difference]: Without dead ends: 581 [2020-12-23 01:41:49,742 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:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-12-23 01:41:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 571. [2020-12-23 01:41:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2020-12-23 01:41:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 869 transitions. [2020-12-23 01:41:49,776 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 869 transitions. Word has length 63 [2020-12-23 01:41:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:49,777 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 869 transitions. [2020-12-23 01:41:49,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 869 transitions. [2020-12-23 01:41:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 01:41:49,778 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:49,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:49,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:41:49,779 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash 408970087, now seen corresponding path program 1 times [2020-12-23 01:41:49,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:49,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559586773] [2020-12-23 01:41:49,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:49,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559586773] [2020-12-23 01:41:49,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501281781] [2020-12-23 01:41:49,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,826 INFO L87 Difference]: Start difference. First operand 571 states and 869 transitions. Second operand 3 states. [2020-12-23 01:41:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:50,030 INFO L93 Difference]: Finished difference Result 1181 states and 1794 transitions. [2020-12-23 01:41:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:50,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-23 01:41:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:50,034 INFO L225 Difference]: With dead ends: 1181 [2020-12-23 01:41:50,034 INFO L226 Difference]: Without dead ends: 618 [2020-12-23 01:41:50,035 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:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-12-23 01:41:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 614. [2020-12-23 01:41:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2020-12-23 01:41:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 930 transitions. [2020-12-23 01:41:50,066 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 930 transitions. Word has length 74 [2020-12-23 01:41:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:50,066 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 930 transitions. [2020-12-23 01:41:50,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 930 transitions. [2020-12-23 01:41:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 01:41:50,068 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:50,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:50,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:41:50,069 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1646674903, now seen corresponding path program 1 times [2020-12-23 01:41:50,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:50,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805557429] [2020-12-23 01:41:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:50,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805557429] [2020-12-23 01:41:50,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:50,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:50,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846422558] [2020-12-23 01:41:50,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:50,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:50,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:50,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,109 INFO L87 Difference]: Start difference. First operand 614 states and 930 transitions. Second operand 3 states. [2020-12-23 01:41:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:50,302 INFO L93 Difference]: Finished difference Result 1224 states and 1852 transitions. [2020-12-23 01:41:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:50,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-12-23 01:41:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:50,306 INFO L225 Difference]: With dead ends: 1224 [2020-12-23 01:41:50,306 INFO L226 Difference]: Without dead ends: 618 [2020-12-23 01:41:50,308 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:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-12-23 01:41:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 614. [2020-12-23 01:41:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2020-12-23 01:41:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 927 transitions. [2020-12-23 01:41:50,336 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 927 transitions. Word has length 75 [2020-12-23 01:41:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:50,336 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 927 transitions. [2020-12-23 01:41:50,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 927 transitions. [2020-12-23 01:41:50,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:41:50,350 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:50,350 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:50,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:41:50,350 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:50,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1588112316, now seen corresponding path program 1 times [2020-12-23 01:41:50,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:50,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770102071] [2020-12-23 01:41:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-23 01:41:50,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770102071] [2020-12-23 01:41:50,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:50,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:50,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318803129] [2020-12-23 01:41:50,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:50,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,394 INFO L87 Difference]: Start difference. First operand 614 states and 927 transitions. Second operand 3 states. [2020-12-23 01:41:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:50,553 INFO L93 Difference]: Finished difference Result 1256 states and 1895 transitions. [2020-12-23 01:41:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:50,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-12-23 01:41:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:50,557 INFO L225 Difference]: With dead ends: 1256 [2020-12-23 01:41:50,557 INFO L226 Difference]: Without dead ends: 650 [2020-12-23 01:41:50,559 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:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-12-23 01:41:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 642. [2020-12-23 01:41:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2020-12-23 01:41:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 961 transitions. [2020-12-23 01:41:50,588 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 961 transitions. Word has length 84 [2020-12-23 01:41:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:50,588 INFO L481 AbstractCegarLoop]: Abstraction has 642 states and 961 transitions. [2020-12-23 01:41:50,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 961 transitions. [2020-12-23 01:41:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 01:41:50,590 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:50,590 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:50,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:41:50,591 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 474906507, now seen corresponding path program 1 times [2020-12-23 01:41:50,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:50,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881227040] [2020-12-23 01:41:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-23 01:41:50,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881227040] [2020-12-23 01:41:50,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:50,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:50,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454378266] [2020-12-23 01:41:50,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:50,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:50,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:50,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,627 INFO L87 Difference]: Start difference. First operand 642 states and 961 transitions. Second operand 3 states. [2020-12-23 01:41:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:50,786 INFO L93 Difference]: Finished difference Result 1284 states and 1922 transitions. [2020-12-23 01:41:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:50,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-23 01:41:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:50,790 INFO L225 Difference]: With dead ends: 1284 [2020-12-23 01:41:50,790 INFO L226 Difference]: Without dead ends: 650 [2020-12-23 01:41:50,791 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:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-12-23 01:41:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 642. [2020-12-23 01:41:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2020-12-23 01:41:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 954 transitions. [2020-12-23 01:41:50,820 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 954 transitions. Word has length 85 [2020-12-23 01:41:50,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:50,820 INFO L481 AbstractCegarLoop]: Abstraction has 642 states and 954 transitions. [2020-12-23 01:41:50,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 954 transitions. [2020-12-23 01:41:50,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 01:41:50,822 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:50,822 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, 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:50,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:41:50,823 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:50,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:50,823 INFO L82 PathProgramCache]: Analyzing trace with hash -282694335, now seen corresponding path program 1 times [2020-12-23 01:41:50,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:50,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206642590] [2020-12-23 01:41:50,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-23 01:41:50,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206642590] [2020-12-23 01:41:50,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:50,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:50,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224803749] [2020-12-23 01:41:50,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:50,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:50,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:50,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,876 INFO L87 Difference]: Start difference. First operand 642 states and 954 transitions. Second operand 3 states. [2020-12-23 01:41:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:51,045 INFO L93 Difference]: Finished difference Result 1316 states and 1949 transitions. [2020-12-23 01:41:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:51,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-12-23 01:41:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:51,049 INFO L225 Difference]: With dead ends: 1316 [2020-12-23 01:41:51,049 INFO L226 Difference]: Without dead ends: 682 [2020-12-23 01:41:51,051 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:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2020-12-23 01:41:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 678. [2020-12-23 01:41:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2020-12-23 01:41:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 998 transitions. [2020-12-23 01:41:51,080 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 998 transitions. Word has length 89 [2020-12-23 01:41:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:51,081 INFO L481 AbstractCegarLoop]: Abstraction has 678 states and 998 transitions. [2020-12-23 01:41:51,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 998 transitions. [2020-12-23 01:41:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 01:41:51,083 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:51,083 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] [2020-12-23 01:41:51,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:41:51,083 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:51,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1446327258, now seen corresponding path program 1 times [2020-12-23 01:41:51,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:51,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032156444] [2020-12-23 01:41:51,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-23 01:41:51,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032156444] [2020-12-23 01:41:51,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:51,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:51,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706317702] [2020-12-23 01:41:51,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:51,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:51,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:51,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:51,122 INFO L87 Difference]: Start difference. First operand 678 states and 998 transitions. Second operand 3 states. [2020-12-23 01:41:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:51,301 INFO L93 Difference]: Finished difference Result 1352 states and 1988 transitions. [2020-12-23 01:41:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:51,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-12-23 01:41:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:51,305 INFO L225 Difference]: With dead ends: 1352 [2020-12-23 01:41:51,305 INFO L226 Difference]: Without dead ends: 682 [2020-12-23 01:41:51,308 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:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2020-12-23 01:41:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 678. [2020-12-23 01:41:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2020-12-23 01:41:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 993 transitions. [2020-12-23 01:41:51,344 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 993 transitions. Word has length 90 [2020-12-23 01:41:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:51,344 INFO L481 AbstractCegarLoop]: Abstraction has 678 states and 993 transitions. [2020-12-23 01:41:51,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 993 transitions. [2020-12-23 01:41:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:41:51,346 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:51,346 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2020-12-23 01:41:51,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:41:51,347 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:51,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1209412422, now seen corresponding path program 1 times [2020-12-23 01:41:51,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:51,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038975379] [2020-12-23 01:41:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:41:51,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038975379] [2020-12-23 01:41:51,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:51,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:51,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935608432] [2020-12-23 01:41:51,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:51,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:51,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:51,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:51,408 INFO L87 Difference]: Start difference. First operand 678 states and 993 transitions. Second operand 3 states. [2020-12-23 01:41:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:51,480 INFO L93 Difference]: Finished difference Result 2004 states and 2929 transitions. [2020-12-23 01:41:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:51,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-23 01:41:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:51,487 INFO L225 Difference]: With dead ends: 2004 [2020-12-23 01:41:51,487 INFO L226 Difference]: Without dead ends: 1334 [2020-12-23 01:41:51,489 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:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2020-12-23 01:41:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 680. [2020-12-23 01:41:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2020-12-23 01:41:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 995 transitions. [2020-12-23 01:41:51,542 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 995 transitions. Word has length 101 [2020-12-23 01:41:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:51,542 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 995 transitions. [2020-12-23 01:41:51,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 995 transitions. [2020-12-23 01:41:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:41:51,546 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:51,546 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2020-12-23 01:41:51,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:41:51,547 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:51,547 INFO L82 PathProgramCache]: Analyzing trace with hash -70451256, now seen corresponding path program 1 times [2020-12-23 01:41:51,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:51,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474109634] [2020-12-23 01:41:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:41:51,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474109634] [2020-12-23 01:41:51,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:51,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:51,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125810734] [2020-12-23 01:41:51,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:51,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:51,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:51,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:51,634 INFO L87 Difference]: Start difference. First operand 680 states and 995 transitions. Second operand 3 states. [2020-12-23 01:41:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:51,697 INFO L93 Difference]: Finished difference Result 1363 states and 1993 transitions. [2020-12-23 01:41:51,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:51,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-23 01:41:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:51,703 INFO L225 Difference]: With dead ends: 1363 [2020-12-23 01:41:51,703 INFO L226 Difference]: Without dead ends: 691 [2020-12-23 01:41:51,705 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:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2020-12-23 01:41:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 678. [2020-12-23 01:41:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2020-12-23 01:41:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 988 transitions. [2020-12-23 01:41:51,759 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 988 transitions. Word has length 101 [2020-12-23 01:41:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:51,759 INFO L481 AbstractCegarLoop]: Abstraction has 678 states and 988 transitions. [2020-12-23 01:41:51,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 988 transitions. [2020-12-23 01:41:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 01:41:51,761 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:51,762 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2020-12-23 01:41:51,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:41:51,762 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1334267025, now seen corresponding path program 1 times [2020-12-23 01:41:51,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:51,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623434333] [2020-12-23 01:41:51,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 01:41:51,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623434333] [2020-12-23 01:41:51,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:51,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:51,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384378593] [2020-12-23 01:41:51,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:51,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:51,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:51,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:51,854 INFO L87 Difference]: Start difference. First operand 678 states and 988 transitions. Second operand 3 states. [2020-12-23 01:41:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:51,991 INFO L93 Difference]: Finished difference Result 1989 states and 2896 transitions. [2020-12-23 01:41:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:51,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-12-23 01:41:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:51,999 INFO L225 Difference]: With dead ends: 1989 [2020-12-23 01:41:51,999 INFO L226 Difference]: Without dead ends: 1319 [2020-12-23 01:41:52,002 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:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2020-12-23 01:41:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1317. [2020-12-23 01:41:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2020-12-23 01:41:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1903 transitions. [2020-12-23 01:41:52,131 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1903 transitions. Word has length 102 [2020-12-23 01:41:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:52,131 INFO L481 AbstractCegarLoop]: Abstraction has 1317 states and 1903 transitions. [2020-12-23 01:41:52,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1903 transitions. [2020-12-23 01:41:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 01:41:52,136 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:52,136 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2020-12-23 01:41:52,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:41:52,139 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:52,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:52,140 INFO L82 PathProgramCache]: Analyzing trace with hash 747461011, now seen corresponding path program 1 times [2020-12-23 01:41:52,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:52,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519460173] [2020-12-23 01:41:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:41:52,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:41:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:41:52,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:41:52,341 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:41:52,342 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:41:52,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:41:52,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:41:52 BoogieIcfgContainer [2020-12-23 01:41:52,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:41:52,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:41:52,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:41:52,509 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:41:52,510 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:44" (3/4) ... [2020-12-23 01:41:52,512 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 01:41:52,657 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_srvr_13.cil.c-witness.graphml [2020-12-23 01:41:52,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:41:52,660 INFO L168 Benchmark]: Toolchain (without parser) took 9525.22 ms. Allocated memory was 156.2 MB in the beginning and 278.9 MB in the end (delta: 122.7 MB). Free memory was 130.7 MB in the beginning and 197.8 MB in the end (delta: -67.1 MB). Peak memory consumption was 56.4 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:52,660 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 156.2 MB. Free memory was 129.0 MB in the beginning and 128.9 MB in the end (delta: 84.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:41:52,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.40 ms. Allocated memory is still 156.2 MB. Free memory was 130.6 MB in the beginning and 115.0 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:52,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.75 ms. Allocated memory is still 156.2 MB. Free memory was 115.0 MB in the beginning and 112.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:52,662 INFO L168 Benchmark]: Boogie Preprocessor took 47.85 ms. Allocated memory is still 156.2 MB. Free memory was 112.0 MB in the beginning and 109.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:52,663 INFO L168 Benchmark]: RCFGBuilder took 1132.55 ms. Allocated memory is still 156.2 MB. Free memory was 109.6 MB in the beginning and 87.6 MB in the end (delta: 22.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:52,663 INFO L168 Benchmark]: TraceAbstraction took 7651.82 ms. Allocated memory was 156.2 MB in the beginning and 278.9 MB in the end (delta: 122.7 MB). Free memory was 87.0 MB in the beginning and 210.5 MB in the end (delta: -123.5 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:41:52,663 INFO L168 Benchmark]: Witness Printer took 148.93 ms. Allocated memory is still 278.9 MB. Free memory was 210.5 MB in the beginning and 197.8 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:52,665 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.21 ms. Allocated memory is still 156.2 MB. Free memory was 129.0 MB in the beginning and 128.9 MB in the end (delta: 84.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 460.40 ms. Allocated memory is still 156.2 MB. Free memory was 130.6 MB in the beginning and 115.0 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 72.75 ms. Allocated memory is still 156.2 MB. Free memory was 115.0 MB in the beginning and 112.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 47.85 ms. Allocated memory is still 156.2 MB. Free memory was 112.0 MB in the beginning and 109.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1132.55 ms. Allocated memory is still 156.2 MB. Free memory was 109.6 MB in the beginning and 87.6 MB in the end (delta: 22.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7651.82 ms. Allocated memory was 156.2 MB in the beginning and 278.9 MB in the end (delta: 122.7 MB). Free memory was 87.0 MB in the beginning and 210.5 MB in the end (delta: -123.5 MB). There was no memory consumed. Max. memory is 8.0 GB. * Witness Printer took 148.93 ms. Allocated memory is still 278.9 MB. Free memory was 210.5 MB in the beginning and 197.8 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 644]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L649] int s ; [L650] int tmp ; [L654] s = 8464 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 = 1; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__cert = __VERIFIER_nondet_int() ; [L27] int s__options = __VERIFIER_nondet_int() ; [L28] int s__verify_mode = __VERIFIER_nondet_int() ; [L29] int s__session__peer = __VERIFIER_nondet_int() ; [L30] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L31] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__cert_request ; [L36] int s__s3__tmp__reuse_message ; [L37] int s__s3__tmp__use_rsa_tmp ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_cipher__algo_strength ; [L42] int s__session__cipher ; [L43] int buf ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp ; [L47] int cb ; [L48] long num1 = __VERIFIER_nondet_long() ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int got_new_session ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 = __VERIFIER_nondet_int() ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int tmp___10 = __VERIFIER_nondet_int() ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] unsigned long __cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 ; [L69] unsigned long __cil_tmp59 ; [L70] int __cil_tmp60 ; [L71] unsigned long __cil_tmp61 ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND FALSE !(tmp___1 + 12288) [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L601] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L602] COND FALSE !(! s__s3__tmp__reuse_message) [L633] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L290] COND FALSE !(ret <= 0) [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 [L298] s__init_num = 0 [L601] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L602] COND FALSE !(! s__s3__tmp__reuse_message) [L633] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L303] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L304] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L305] COND TRUE __cil_tmp56 + 256UL [L306] skip = 1 [L317] s__state = 8528 [L318] s__init_num = 0 [L601] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L602] COND FALSE !(! s__s3__tmp__reuse_message) [L633] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L322] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L323] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L325] __cil_tmp57 = (unsigned long )s__options [L326] COND TRUE __cil_tmp57 + 2097152UL [L327] s__s3__tmp__use_rsa_tmp = 1 [L332] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L359] ret = __VERIFIER_nondet_int() [L360] COND FALSE !(blastFlag == 6) [L363] COND FALSE !(ret <= 0) [L380] s__state = 8544 [L381] s__init_num = 0 [L601] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE state == 8528 [L605] COND TRUE s__state == 8544 [L606] COND TRUE tmp___7 != 1024 [L607] COND TRUE tmp___7 != 512 [L608] COND TRUE __cil_tmp58 != 4294967294 [L609] COND TRUE l != 4294967266 [L644] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.4s, OverallIterations: 26, TraceHistogramMax: 4, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4418 SDtfs, 4358 SDslu, 1315 SDs, 0 SdLazy, 2050 SolverSat, 916 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1317occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1523 NumberOfCodeBlocks, 1523 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1396 ConstructedInterpolants, 0 QuantifiedInterpolants, 183768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 646/646 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 incorrect! Received shutdown request...