/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_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:35:12,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:35:12,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:35:12,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:35:12,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:35:12,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:35:12,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:35:12,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:35:12,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:35:12,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:35:12,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:35:12,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:35:12,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:35:12,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:35:12,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:35:12,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:35:12,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:35:12,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:35:12,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:35:12,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:35:12,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:35:12,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:35:12,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:35:12,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:35:12,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:35:12,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:35:12,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:35:13,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:35:13,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:35:13,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:35:13,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:35:13,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:35:13,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:35:13,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:35:13,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:35:13,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:35:13,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:35:13,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:35:13,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:35:13,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:35:13,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:35:13,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:35:13,066 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:35:13,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:35:13,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:35:13,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:35:13,068 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:35:13,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:35:13,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:35:13,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:35:13,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:35:13,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:35:13,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:35:13,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:35:13,070 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:35:13,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:35:13,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:35:13,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:35:13,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:35:13,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:35:13,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:35:13,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:35:13,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:35:13,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:35:13,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:35:13,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:35:13,073 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:35:13,073 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 [2021-01-06 11:35:13,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:35:13,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:35:13,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:35:13,513 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:35:13,514 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:35:13,515 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-1.c [2021-01-06 11:35:13,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/86a0c5328/b3f3366c283a44ada301e4d067332836/FLAGcb14485c1 [2021-01-06 11:35:14,229 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:35:14,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-1.c [2021-01-06 11:35:14,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/86a0c5328/b3f3366c283a44ada301e4d067332836/FLAGcb14485c1 [2021-01-06 11:35:14,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/86a0c5328/b3f3366c283a44ada301e4d067332836 [2021-01-06 11:35:14,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:35:14,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:35:14,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:14,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:35:14,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:35:14,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:14" (1/1) ... [2021-01-06 11:35:14,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d7746d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:14, skipping insertion in model container [2021-01-06 11:35:14,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:14" (1/1) ... [2021-01-06 11:35:14,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:35:14,611 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[~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[~tmp___3~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[~tmp___4~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[~tmp___5~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[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~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[~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__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~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[~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,] [2021-01-06 11:35:14,915 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_1.cil-1.c[42831,42844] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2021-01-06 11:35:14,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:14,954 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[~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[~tmp___3~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[~tmp___4~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[~tmp___5~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[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~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[~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__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~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[~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,] [2021-01-06 11:35:15,099 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_1.cil-1.c[42831,42844] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2021-01-06 11:35:15,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:15,130 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:35:15,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15 WrapperNode [2021-01-06 11:35:15,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:15,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:15,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:35:15,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:35:15,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15" (1/1) ... [2021-01-06 11:35:15,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15" (1/1) ... [2021-01-06 11:35:15,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:15,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:35:15,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:35:15,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:35:15,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15" (1/1) ... [2021-01-06 11:35:15,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15" (1/1) ... [2021-01-06 11:35:15,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15" (1/1) ... [2021-01-06 11:35:15,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15" (1/1) ... [2021-01-06 11:35:15,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15" (1/1) ... [2021-01-06 11:35:15,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15" (1/1) ... [2021-01-06 11:35:15,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15" (1/1) ... [2021-01-06 11:35:15,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:35:15,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:35:15,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:35:15,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:35:15,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15" (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 [2021-01-06 11:35:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:35:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:35:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:35:15,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:35:15,694 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:35:16,408 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-01-06 11:35:16,409 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-01-06 11:35:16,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:35:16,421 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:35:16,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:16 BoogieIcfgContainer [2021-01-06 11:35:16,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:35:16,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:35:16,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:35:16,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:35:16,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:35:14" (1/3) ... [2021-01-06 11:35:16,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6364ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:16, skipping insertion in model container [2021-01-06 11:35:16,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:15" (2/3) ... [2021-01-06 11:35:16,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6364ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:16, skipping insertion in model container [2021-01-06 11:35:16,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:16" (3/3) ... [2021-01-06 11:35:16,433 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-1.c [2021-01-06 11:35:16,440 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:35:16,446 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:35:16,466 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:35:16,495 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:35:16,495 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:35:16,495 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:35:16,496 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:35:16,496 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:35:16,496 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:35:16,496 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:35:16,496 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:35:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2021-01-06 11:35:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:35:16,527 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:16,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:16,529 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash -947483198, now seen corresponding path program 1 times [2021-01-06 11:35:16,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:16,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793063993] [2021-01-06 11:35:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:16,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793063993] [2021-01-06 11:35:16,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:16,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:16,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655713767] [2021-01-06 11:35:17,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:17,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:17,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:17,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:17,029 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2021-01-06 11:35:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:17,343 INFO L93 Difference]: Finished difference Result 333 states and 570 transitions. [2021-01-06 11:35:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:17,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2021-01-06 11:35:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:17,360 INFO L225 Difference]: With dead ends: 333 [2021-01-06 11:35:17,360 INFO L226 Difference]: Without dead ends: 178 [2021-01-06 11:35:17,364 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 [2021-01-06 11:35:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-01-06 11:35:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2021-01-06 11:35:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2021-01-06 11:35:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 278 transitions. [2021-01-06 11:35:17,441 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 278 transitions. Word has length 45 [2021-01-06 11:35:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:17,442 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 278 transitions. [2021-01-06 11:35:17,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 278 transitions. [2021-01-06 11:35:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-06 11:35:17,445 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:17,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:17,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:35:17,446 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash 472840096, now seen corresponding path program 1 times [2021-01-06 11:35:17,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:17,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928519284] [2021-01-06 11:35:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:17,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928519284] [2021-01-06 11:35:17,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:17,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:17,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016664876] [2021-01-06 11:35:17,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:17,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:17,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:17,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:17,545 INFO L87 Difference]: Start difference. First operand 172 states and 278 transitions. Second operand 3 states. [2021-01-06 11:35:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:17,767 INFO L93 Difference]: Finished difference Result 385 states and 632 transitions. [2021-01-06 11:35:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:17,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2021-01-06 11:35:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:17,770 INFO L225 Difference]: With dead ends: 385 [2021-01-06 11:35:17,771 INFO L226 Difference]: Without dead ends: 219 [2021-01-06 11:35:17,772 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 [2021-01-06 11:35:17,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-01-06 11:35:17,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2021-01-06 11:35:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2021-01-06 11:35:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 355 transitions. [2021-01-06 11:35:17,797 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 355 transitions. Word has length 46 [2021-01-06 11:35:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:17,800 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 355 transitions. [2021-01-06 11:35:17,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 355 transitions. [2021-01-06 11:35:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:35:17,807 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:17,807 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:17,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:35:17,808 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:17,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:17,809 INFO L82 PathProgramCache]: Analyzing trace with hash 488183924, now seen corresponding path program 1 times [2021-01-06 11:35:17,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:17,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84004292] [2021-01-06 11:35:17,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:17,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84004292] [2021-01-06 11:35:17,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:17,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:17,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174254466] [2021-01-06 11:35:17,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:17,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:17,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:17,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:17,981 INFO L87 Difference]: Start difference. First operand 213 states and 355 transitions. Second operand 3 states. [2021-01-06 11:35:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:18,204 INFO L93 Difference]: Finished difference Result 449 states and 756 transitions. [2021-01-06 11:35:18,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:18,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 11:35:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:18,208 INFO L225 Difference]: With dead ends: 449 [2021-01-06 11:35:18,208 INFO L226 Difference]: Without dead ends: 244 [2021-01-06 11:35:18,210 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 [2021-01-06 11:35:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-01-06 11:35:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-01-06 11:35:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2021-01-06 11:35:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 411 transitions. [2021-01-06 11:35:18,229 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 411 transitions. Word has length 74 [2021-01-06 11:35:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:18,229 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 411 transitions. [2021-01-06 11:35:18,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 411 transitions. [2021-01-06 11:35:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:35:18,233 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:18,234 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:18,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:35:18,234 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:18,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1651483739, now seen corresponding path program 1 times [2021-01-06 11:35:18,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:18,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411109410] [2021-01-06 11:35:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:18,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411109410] [2021-01-06 11:35:18,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:18,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:18,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156142374] [2021-01-06 11:35:18,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:18,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:18,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:18,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:18,381 INFO L87 Difference]: Start difference. First operand 244 states and 411 transitions. Second operand 3 states. [2021-01-06 11:35:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:18,630 INFO L93 Difference]: Finished difference Result 526 states and 892 transitions. [2021-01-06 11:35:18,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:18,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:35:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:18,634 INFO L225 Difference]: With dead ends: 526 [2021-01-06 11:35:18,634 INFO L226 Difference]: Without dead ends: 290 [2021-01-06 11:35:18,635 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 [2021-01-06 11:35:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-01-06 11:35:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2021-01-06 11:35:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2021-01-06 11:35:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 486 transitions. [2021-01-06 11:35:18,651 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 486 transitions. Word has length 85 [2021-01-06 11:35:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:18,652 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 486 transitions. [2021-01-06 11:35:18,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 486 transitions. [2021-01-06 11:35:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 11:35:18,655 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:18,655 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:18,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:35:18,656 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1358393014, now seen corresponding path program 1 times [2021-01-06 11:35:18,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:18,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821600250] [2021-01-06 11:35:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:18,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821600250] [2021-01-06 11:35:18,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:18,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:18,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345868449] [2021-01-06 11:35:18,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:18,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:18,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:18,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:18,753 INFO L87 Difference]: Start difference. First operand 286 states and 486 transitions. Second operand 3 states. [2021-01-06 11:35:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:18,903 INFO L93 Difference]: Finished difference Result 581 states and 988 transitions. [2021-01-06 11:35:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:18,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-06 11:35:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:18,906 INFO L225 Difference]: With dead ends: 581 [2021-01-06 11:35:18,906 INFO L226 Difference]: Without dead ends: 303 [2021-01-06 11:35:18,907 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 [2021-01-06 11:35:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-01-06 11:35:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2021-01-06 11:35:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2021-01-06 11:35:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 508 transitions. [2021-01-06 11:35:18,936 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 508 transitions. Word has length 86 [2021-01-06 11:35:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:18,936 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 508 transitions. [2021-01-06 11:35:18,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 508 transitions. [2021-01-06 11:35:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 11:35:18,939 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:18,939 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:18,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:35:18,940 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:18,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:18,940 INFO L82 PathProgramCache]: Analyzing trace with hash 709328611, now seen corresponding path program 1 times [2021-01-06 11:35:18,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:18,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137509256] [2021-01-06 11:35:18,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:19,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137509256] [2021-01-06 11:35:19,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:19,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:19,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156340352] [2021-01-06 11:35:19,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:19,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:19,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:19,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:19,032 INFO L87 Difference]: Start difference. First operand 301 states and 508 transitions. Second operand 3 states. [2021-01-06 11:35:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:19,239 INFO L93 Difference]: Finished difference Result 598 states and 1009 transitions. [2021-01-06 11:35:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:19,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-06 11:35:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:19,242 INFO L225 Difference]: With dead ends: 598 [2021-01-06 11:35:19,243 INFO L226 Difference]: Without dead ends: 303 [2021-01-06 11:35:19,244 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 [2021-01-06 11:35:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-01-06 11:35:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-01-06 11:35:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-06 11:35:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 503 transitions. [2021-01-06 11:35:19,256 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 503 transitions. Word has length 86 [2021-01-06 11:35:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:19,257 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 503 transitions. [2021-01-06 11:35:19,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 503 transitions. [2021-01-06 11:35:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:35:19,258 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:19,259 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:19,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:35:19,259 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash 564851953, now seen corresponding path program 1 times [2021-01-06 11:35:19,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:19,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138754400] [2021-01-06 11:35:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:19,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138754400] [2021-01-06 11:35:19,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:19,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:19,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40560715] [2021-01-06 11:35:19,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:19,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:19,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:19,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:19,305 INFO L87 Difference]: Start difference. First operand 299 states and 503 transitions. Second operand 3 states. [2021-01-06 11:35:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:19,446 INFO L93 Difference]: Finished difference Result 592 states and 996 transitions. [2021-01-06 11:35:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:19,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-06 11:35:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:19,449 INFO L225 Difference]: With dead ends: 592 [2021-01-06 11:35:19,449 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:35:19,450 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 [2021-01-06 11:35:19,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:35:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-01-06 11:35:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-06 11:35:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 499 transitions. [2021-01-06 11:35:19,463 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 499 transitions. Word has length 87 [2021-01-06 11:35:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:19,463 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 499 transitions. [2021-01-06 11:35:19,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 499 transitions. [2021-01-06 11:35:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:35:19,465 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:19,465 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:19,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:35:19,465 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:19,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:19,466 INFO L82 PathProgramCache]: Analyzing trace with hash 19025617, now seen corresponding path program 1 times [2021-01-06 11:35:19,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:19,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722101405] [2021-01-06 11:35:19,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-01-06 11:35:19,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722101405] [2021-01-06 11:35:19,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:19,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:19,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255674313] [2021-01-06 11:35:19,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:19,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:19,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:19,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:19,511 INFO L87 Difference]: Start difference. First operand 299 states and 499 transitions. Second operand 3 states. [2021-01-06 11:35:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:19,663 INFO L93 Difference]: Finished difference Result 599 states and 998 transitions. [2021-01-06 11:35:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:19,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 11:35:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:19,666 INFO L225 Difference]: With dead ends: 599 [2021-01-06 11:35:19,666 INFO L226 Difference]: Without dead ends: 308 [2021-01-06 11:35:19,667 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 [2021-01-06 11:35:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-01-06 11:35:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2021-01-06 11:35:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2021-01-06 11:35:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 505 transitions. [2021-01-06 11:35:19,680 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 505 transitions. Word has length 100 [2021-01-06 11:35:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:19,681 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 505 transitions. [2021-01-06 11:35:19,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 505 transitions. [2021-01-06 11:35:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:35:19,682 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:19,683 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:19,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:35:19,683 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:19,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1778247501, now seen corresponding path program 1 times [2021-01-06 11:35:19,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:19,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987976736] [2021-01-06 11:35:19,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:19,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987976736] [2021-01-06 11:35:19,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:19,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:19,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520677232] [2021-01-06 11:35:19,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:19,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:19,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:19,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:19,742 INFO L87 Difference]: Start difference. First operand 308 states and 505 transitions. Second operand 3 states. [2021-01-06 11:35:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:19,906 INFO L93 Difference]: Finished difference Result 639 states and 1051 transitions. [2021-01-06 11:35:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:19,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 11:35:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:19,912 INFO L225 Difference]: With dead ends: 639 [2021-01-06 11:35:19,912 INFO L226 Difference]: Without dead ends: 339 [2021-01-06 11:35:19,914 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 [2021-01-06 11:35:19,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-01-06 11:35:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2021-01-06 11:35:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2021-01-06 11:35:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 552 transitions. [2021-01-06 11:35:19,937 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 552 transitions. Word has length 100 [2021-01-06 11:35:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:19,940 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 552 transitions. [2021-01-06 11:35:19,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:19,940 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 552 transitions. [2021-01-06 11:35:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 11:35:19,945 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:19,945 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:19,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:35:19,946 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:19,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1388103916, now seen corresponding path program 1 times [2021-01-06 11:35:19,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:19,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037113753] [2021-01-06 11:35:19,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:20,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037113753] [2021-01-06 11:35:20,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:20,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:20,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435117875] [2021-01-06 11:35:20,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:20,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:20,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:20,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:20,048 INFO L87 Difference]: Start difference. First operand 337 states and 552 transitions. Second operand 3 states. [2021-01-06 11:35:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:20,288 INFO L93 Difference]: Finished difference Result 668 states and 1094 transitions. [2021-01-06 11:35:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:20,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2021-01-06 11:35:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:20,294 INFO L225 Difference]: With dead ends: 668 [2021-01-06 11:35:20,294 INFO L226 Difference]: Without dead ends: 339 [2021-01-06 11:35:20,296 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 [2021-01-06 11:35:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-01-06 11:35:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2021-01-06 11:35:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2021-01-06 11:35:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 548 transitions. [2021-01-06 11:35:20,319 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 548 transitions. Word has length 101 [2021-01-06 11:35:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:20,320 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 548 transitions. [2021-01-06 11:35:20,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 548 transitions. [2021-01-06 11:35:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 11:35:20,322 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:20,322 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:20,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:35:20,322 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:20,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:20,323 INFO L82 PathProgramCache]: Analyzing trace with hash -916073731, now seen corresponding path program 1 times [2021-01-06 11:35:20,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:20,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024981278] [2021-01-06 11:35:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:20,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024981278] [2021-01-06 11:35:20,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:20,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:20,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203693849] [2021-01-06 11:35:20,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:20,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:20,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:20,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:20,420 INFO L87 Difference]: Start difference. First operand 337 states and 548 transitions. Second operand 3 states. [2021-01-06 11:35:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:20,648 INFO L93 Difference]: Finished difference Result 701 states and 1144 transitions. [2021-01-06 11:35:20,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:20,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2021-01-06 11:35:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:20,653 INFO L225 Difference]: With dead ends: 701 [2021-01-06 11:35:20,653 INFO L226 Difference]: Without dead ends: 372 [2021-01-06 11:35:20,654 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 [2021-01-06 11:35:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-01-06 11:35:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2021-01-06 11:35:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2021-01-06 11:35:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 590 transitions. [2021-01-06 11:35:20,673 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 590 transitions. Word has length 102 [2021-01-06 11:35:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:20,673 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 590 transitions. [2021-01-06 11:35:20,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 590 transitions. [2021-01-06 11:35:20,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 11:35:20,675 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:20,675 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:20,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:35:20,676 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:20,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:20,676 INFO L82 PathProgramCache]: Analyzing trace with hash 62624868, now seen corresponding path program 1 times [2021-01-06 11:35:20,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:20,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092909177] [2021-01-06 11:35:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:20,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092909177] [2021-01-06 11:35:20,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:20,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:20,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799043717] [2021-01-06 11:35:20,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:20,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:20,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:20,752 INFO L87 Difference]: Start difference. First operand 364 states and 590 transitions. Second operand 3 states. [2021-01-06 11:35:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:20,928 INFO L93 Difference]: Finished difference Result 728 states and 1181 transitions. [2021-01-06 11:35:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:20,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2021-01-06 11:35:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:20,931 INFO L225 Difference]: With dead ends: 728 [2021-01-06 11:35:20,931 INFO L226 Difference]: Without dead ends: 372 [2021-01-06 11:35:20,932 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 [2021-01-06 11:35:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-01-06 11:35:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2021-01-06 11:35:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2021-01-06 11:35:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 585 transitions. [2021-01-06 11:35:20,950 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 585 transitions. Word has length 103 [2021-01-06 11:35:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:20,950 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 585 transitions. [2021-01-06 11:35:20,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 585 transitions. [2021-01-06 11:35:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:35:20,952 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:20,952 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:20,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:35:20,952 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:20,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1773852357, now seen corresponding path program 1 times [2021-01-06 11:35:20,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:20,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436029807] [2021-01-06 11:35:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:35:21,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436029807] [2021-01-06 11:35:21,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:21,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:21,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430049564] [2021-01-06 11:35:21,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:21,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:21,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:21,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:21,016 INFO L87 Difference]: Start difference. First operand 364 states and 585 transitions. Second operand 3 states. [2021-01-06 11:35:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:21,200 INFO L93 Difference]: Finished difference Result 745 states and 1199 transitions. [2021-01-06 11:35:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:21,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:35:21,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:21,204 INFO L225 Difference]: With dead ends: 745 [2021-01-06 11:35:21,204 INFO L226 Difference]: Without dead ends: 389 [2021-01-06 11:35:21,205 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 [2021-01-06 11:35:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-01-06 11:35:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2021-01-06 11:35:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2021-01-06 11:35:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 614 transitions. [2021-01-06 11:35:21,227 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 614 transitions. Word has length 106 [2021-01-06 11:35:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:21,227 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 614 transitions. [2021-01-06 11:35:21,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 614 transitions. [2021-01-06 11:35:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 11:35:21,229 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:21,230 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:21,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:35:21,230 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:21,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:21,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1450939714, now seen corresponding path program 1 times [2021-01-06 11:35:21,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:21,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443593574] [2021-01-06 11:35:21,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:35:21,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443593574] [2021-01-06 11:35:21,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:21,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:21,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653403417] [2021-01-06 11:35:21,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:21,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:21,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:21,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:21,287 INFO L87 Difference]: Start difference. First operand 385 states and 614 transitions. Second operand 3 states. [2021-01-06 11:35:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:21,442 INFO L93 Difference]: Finished difference Result 766 states and 1222 transitions. [2021-01-06 11:35:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:21,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-06 11:35:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:21,445 INFO L225 Difference]: With dead ends: 766 [2021-01-06 11:35:21,445 INFO L226 Difference]: Without dead ends: 389 [2021-01-06 11:35:21,446 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 [2021-01-06 11:35:21,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-01-06 11:35:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2021-01-06 11:35:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2021-01-06 11:35:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 608 transitions. [2021-01-06 11:35:21,464 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 608 transitions. Word has length 107 [2021-01-06 11:35:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:21,464 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 608 transitions. [2021-01-06 11:35:21,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 608 transitions. [2021-01-06 11:35:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:35:21,466 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:21,466 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:21,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:35:21,466 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1044207465, now seen corresponding path program 1 times [2021-01-06 11:35:21,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:21,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953990465] [2021-01-06 11:35:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:35:21,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953990465] [2021-01-06 11:35:21,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:21,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:21,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860555987] [2021-01-06 11:35:21,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:21,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:21,520 INFO L87 Difference]: Start difference. First operand 385 states and 608 transitions. Second operand 3 states. [2021-01-06 11:35:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:21,575 INFO L93 Difference]: Finished difference Result 1093 states and 1730 transitions. [2021-01-06 11:35:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:21,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:35:21,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:21,581 INFO L225 Difference]: With dead ends: 1093 [2021-01-06 11:35:21,581 INFO L226 Difference]: Without dead ends: 716 [2021-01-06 11:35:21,582 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 [2021-01-06 11:35:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-01-06 11:35:21,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-01-06 11:35:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2021-01-06 11:35:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1128 transitions. [2021-01-06 11:35:21,616 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1128 transitions. Word has length 122 [2021-01-06 11:35:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:21,617 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 1128 transitions. [2021-01-06 11:35:21,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1128 transitions. [2021-01-06 11:35:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:35:21,619 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:21,619 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:21,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:35:21,620 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:21,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1005180377, now seen corresponding path program 1 times [2021-01-06 11:35:21,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:21,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813280555] [2021-01-06 11:35:21,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:35:21,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:35:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:35:21,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:35:21,760 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:35:21,761 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:35:21,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:35:21,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:35:21 BoogieIcfgContainer [2021-01-06 11:35:21,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:35:21,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:35:21,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:35:21,944 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:35:21,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:16" (3/4) ... [2021-01-06 11:35:21,947 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 11:35:22,171 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_srvr_1.cil-1.c-witness.graphml [2021-01-06 11:35:22,171 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:35:22,174 INFO L168 Benchmark]: Toolchain (without parser) took 7620.14 ms. Allocated memory was 179.3 MB in the beginning and 273.7 MB in the end (delta: 94.4 MB). Free memory was 154.3 MB in the beginning and 243.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 153.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:22,175 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 179.3 MB. Free memory is still 150.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:35:22,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.06 ms. Allocated memory is still 179.3 MB. Free memory was 154.0 MB in the beginning and 138.8 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:22,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.71 ms. Allocated memory is still 179.3 MB. Free memory was 138.8 MB in the beginning and 135.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:22,177 INFO L168 Benchmark]: Boogie Preprocessor took 96.53 ms. Allocated memory is still 179.3 MB. Free memory was 135.8 MB in the beginning and 133.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:22,177 INFO L168 Benchmark]: RCFGBuilder took 1097.29 ms. Allocated memory is still 179.3 MB. Free memory was 133.7 MB in the beginning and 81.9 MB in the end (delta: 51.7 MB). Peak memory consumption was 51.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:22,178 INFO L168 Benchmark]: TraceAbstraction took 5517.94 ms. Allocated memory was 179.3 MB in the beginning and 273.7 MB in the end (delta: 94.4 MB). Free memory was 81.6 MB in the beginning and 103.0 MB in the end (delta: -21.4 MB). Peak memory consumption was 74.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:22,178 INFO L168 Benchmark]: Witness Printer took 227.74 ms. Allocated memory is still 273.7 MB. Free memory was 103.0 MB in the beginning and 243.0 MB in the end (delta: -140.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:22,180 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.19 ms. Allocated memory is still 179.3 MB. Free memory is still 150.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 576.06 ms. Allocated memory is still 179.3 MB. Free memory was 154.0 MB in the beginning and 138.8 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 91.71 ms. Allocated memory is still 179.3 MB. Free memory was 138.8 MB in the beginning and 135.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 96.53 ms. Allocated memory is still 179.3 MB. Free memory was 135.8 MB in the beginning and 133.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1097.29 ms. Allocated memory is still 179.3 MB. Free memory was 133.7 MB in the beginning and 81.9 MB in the end (delta: 51.7 MB). Peak memory consumption was 51.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5517.94 ms. Allocated memory was 179.3 MB in the beginning and 273.7 MB in the end (delta: 94.4 MB). Free memory was 81.6 MB in the beginning and 103.0 MB in the end (delta: -21.4 MB). Peak memory consumption was 74.6 MB. Max. memory is 8.0 GB. * Witness Printer took 227.74 ms. Allocated memory is still 273.7 MB. Free memory was 103.0 MB in the beginning and 243.0 MB in the end (delta: -140.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 613]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L618] int s ; [L619] int tmp ; [L623] 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 = __VERIFIER_nondet_int() ; [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 = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L42] int s__session__cipher ; [L43] int buf = __VERIFIER_nondet_int() ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp = __VERIFIER_nondet_long() ; [L47] int cb ; [L48] long num1 ; [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 ; [L57] int tmp___4 ; [L58] int tmp___5 ; [L59] int tmp___6 ; [L60] int tmp___7 ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 ; [L63] int tmp___10 ; [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 ; [L75] s__state = initial_state [L76] blastFlag = 0 [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 [L270] s__shutdown = 0 [L271] ret = __VERIFIER_nondet_int() [L272] COND TRUE blastFlag == 0 [L273] blastFlag = 1 [L275] COND FALSE !(ret <= 0) [L278] got_new_session = 1 [L279] s__state = 8496 [L280] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L602] 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 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 1 [L286] blastFlag = 2 [L288] COND FALSE !(ret <= 0) [L291] COND TRUE \read(s__hit) [L292] s__state = 8656 [L296] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L602] 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 FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND FALSE !(s__state == 8448) [L168] COND FALSE !(s__state == 8576) [L171] COND FALSE !(s__state == 8577) [L174] COND FALSE !(s__state == 8592) [L177] COND FALSE !(s__state == 8593) [L180] COND FALSE !(s__state == 8608) [L183] COND FALSE !(s__state == 8609) [L186] COND FALSE !(s__state == 8640) [L189] COND FALSE !(s__state == 8641) [L192] COND TRUE s__state == 8656 [L490] s__session__cipher = s__s3__tmp__new_cipher [L491] tmp___9 = __VERIFIER_nondet_int() [L492] COND FALSE !(! tmp___9) [L496] ret = __VERIFIER_nondet_int() [L497] COND TRUE blastFlag == 2 [L498] blastFlag = 3 [L500] COND FALSE !(ret <= 0) [L503] s__state = 8672 [L504] s__init_num = 0 [L505] tmp___10 = __VERIFIER_nondet_int() [L506] COND FALSE !(! tmp___10) [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L602] 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 FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND FALSE !(s__state == 8448) [L168] COND FALSE !(s__state == 8576) [L171] COND FALSE !(s__state == 8577) [L174] COND FALSE !(s__state == 8592) [L177] COND FALSE !(s__state == 8593) [L180] COND FALSE !(s__state == 8608) [L183] COND FALSE !(s__state == 8609) [L186] COND FALSE !(s__state == 8640) [L189] COND FALSE !(s__state == 8641) [L192] COND FALSE !(s__state == 8656) [L195] COND FALSE !(s__state == 8657) [L198] COND TRUE s__state == 8672 [L513] ret = __VERIFIER_nondet_int() [L514] COND FALSE !(blastFlag == 4) [L517] COND TRUE blastFlag == 3 [L613] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.2s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2225 SDtfs, 2216 SDslu, 435 SDs, 0 SdLazy, 1340 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=716occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1472 NumberOfCodeBlocks, 1472 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1335 ConstructedInterpolants, 0 QuantifiedInterpolants, 221866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 736/736 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...