/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_14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:41:41,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:41:41,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:41:41,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:41:41,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:41:41,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:41:41,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:41:41,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:41:41,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:41:41,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:41:41,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:41:41,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:41:41,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:41:41,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:41:41,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:41:41,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:41:41,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:41:41,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:41:41,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:41:41,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:41:41,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:41:41,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:41:41,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:41:41,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:41:41,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:41:41,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:41:41,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:41:41,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:41:41,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:41:41,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:41:41,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:41:41,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:41:41,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:41:41,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:41:41,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:41:41,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:41:41,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:41:41,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:41:41,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:41:41,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:41:41,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:41:41,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 01:41:41,722 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:41:41,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:41:41,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:41:41,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:41:41,725 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:41:41,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:41:41,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:41:41,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:41:41,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:41:41,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:41:41,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:41:41,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:41:41,727 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:41:41,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:41:41,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:41:41,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:41:41,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:41:41,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:41:41,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:41:41,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:41:41,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:41:41,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:41:41,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:41:41,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:41:41,730 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:41:41,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 01:41:42,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:41:42,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:41:42,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:41:42,150 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:41:42,151 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:41:42,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_14.cil.c [2020-12-23 01:41:42,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6a5f6d578/22fb3d765fc04f94985e1469d8fcb2b1/FLAGb1c79f65f [2020-12-23 01:41:43,012 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:41:43,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_14.cil.c [2020-12-23 01:41:43,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6a5f6d578/22fb3d765fc04f94985e1469d8fcb2b1/FLAGb1c79f65f [2020-12-23 01:41:43,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6a5f6d578/22fb3d765fc04f94985e1469d8fcb2b1 [2020-12-23 01:41:43,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:41:43,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:41:43,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:41:43,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:41:43,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:41:43,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4d7345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43, skipping insertion in model container [2020-12-23 01:41:43,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:41:43,403 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__reuse_message~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:41:43,736 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_14.cil.c[44685,44698] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2020-12-23 01:41:43,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:41:43,761 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__reuse_message~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:41:43,834 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_14.cil.c[44685,44698] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2020-12-23 01:41:43,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:41:43,866 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:41:43,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43 WrapperNode [2020-12-23 01:41:43,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:41:43,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:41:43,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:41:43,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:41:43,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:41:43,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:41:43,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:41:43,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:41:43,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (1/1) ... [2020-12-23 01:41:43,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:41:43,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:41:43,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:41:43,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:41:43,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:41:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:41:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:41:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:41:44,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:41:44,332 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:41:45,087 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2020-12-23 01:41:45,088 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2020-12-23 01:41:45,099 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:41:45,100 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:41:45,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:45 BoogieIcfgContainer [2020-12-23 01:41:45,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:41:45,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:41:45,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:41:45,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:41:45,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:41:43" (1/3) ... [2020-12-23 01:41:45,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46df355b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:41:45, skipping insertion in model container [2020-12-23 01:41:45,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:43" (2/3) ... [2020-12-23 01:41:45,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46df355b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:41:45, skipping insertion in model container [2020-12-23 01:41:45,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:45" (3/3) ... [2020-12-23 01:41:45,111 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2020-12-23 01:41:45,118 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:41:45,124 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:41:45,144 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:41:45,173 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:41:45,174 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:41:45,174 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:41:45,174 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:41:45,174 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:41:45,174 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:41:45,174 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:41:45,175 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:41:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-12-23 01:41:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 01:41:45,202 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:45,203 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] [2020-12-23 01:41:45,203 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1180429726, now seen corresponding path program 1 times [2020-12-23 01:41:45,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:45,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693810279] [2020-12-23 01:41:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:45,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693810279] [2020-12-23 01:41:45,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:45,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:45,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635968092] [2020-12-23 01:41:45,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:45,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:45,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:45,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:45,525 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 3 states. [2020-12-23 01:41:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:45,914 INFO L93 Difference]: Finished difference Result 324 states and 556 transitions. [2020-12-23 01:41:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:45,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-23 01:41:45,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:45,948 INFO L225 Difference]: With dead ends: 324 [2020-12-23 01:41:45,949 INFO L226 Difference]: Without dead ends: 161 [2020-12-23 01:41:45,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-23 01:41:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2020-12-23 01:41:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 01:41:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2020-12-23 01:41:46,064 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 23 [2020-12-23 01:41:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:46,064 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 249 transitions. [2020-12-23 01:41:46,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 249 transitions. [2020-12-23 01:41:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 01:41:46,068 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:46,068 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] [2020-12-23 01:41:46,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:41:46,069 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:46,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash -932054356, now seen corresponding path program 1 times [2020-12-23 01:41:46,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:46,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798501279] [2020-12-23 01:41:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:46,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798501279] [2020-12-23 01:41:46,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:46,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:46,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672392646] [2020-12-23 01:41:46,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:46,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:46,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:46,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,169 INFO L87 Difference]: Start difference. First operand 157 states and 249 transitions. Second operand 3 states. [2020-12-23 01:41:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:46,413 INFO L93 Difference]: Finished difference Result 331 states and 523 transitions. [2020-12-23 01:41:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:46,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-23 01:41:46,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:46,416 INFO L225 Difference]: With dead ends: 331 [2020-12-23 01:41:46,416 INFO L226 Difference]: Without dead ends: 182 [2020-12-23 01:41:46,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-12-23 01:41:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2020-12-23 01:41:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-12-23 01:41:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 282 transitions. [2020-12-23 01:41:46,434 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 282 transitions. Word has length 24 [2020-12-23 01:41:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:46,435 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 282 transitions. [2020-12-23 01:41:46,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 282 transitions. [2020-12-23 01:41:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 01:41:46,436 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:46,436 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] [2020-12-23 01:41:46,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:41:46,437 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:46,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:46,437 INFO L82 PathProgramCache]: Analyzing trace with hash -945010985, now seen corresponding path program 1 times [2020-12-23 01:41:46,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:46,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161107042] [2020-12-23 01:41:46,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:46,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161107042] [2020-12-23 01:41:46,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:46,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:46,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634099529] [2020-12-23 01:41:46,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:46,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:46,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:46,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,520 INFO L87 Difference]: Start difference. First operand 180 states and 282 transitions. Second operand 3 states. [2020-12-23 01:41:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:46,701 INFO L93 Difference]: Finished difference Result 362 states and 567 transitions. [2020-12-23 01:41:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:46,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-23 01:41:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:46,705 INFO L225 Difference]: With dead ends: 362 [2020-12-23 01:41:46,706 INFO L226 Difference]: Without dead ends: 190 [2020-12-23 01:41:46,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-12-23 01:41:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2020-12-23 01:41:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-12-23 01:41:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2020-12-23 01:41:46,748 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 24 [2020-12-23 01:41:46,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:46,748 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2020-12-23 01:41:46,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2020-12-23 01:41:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 01:41:46,750 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:46,750 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] [2020-12-23 01:41:46,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:41:46,750 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1648361961, now seen corresponding path program 1 times [2020-12-23 01:41:46,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:46,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037049702] [2020-12-23 01:41:46,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:46,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037049702] [2020-12-23 01:41:46,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:46,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:46,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949045668] [2020-12-23 01:41:46,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:46,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:46,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:46,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,887 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand 3 states. [2020-12-23 01:41:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,058 INFO L93 Difference]: Finished difference Result 367 states and 577 transitions. [2020-12-23 01:41:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-23 01:41:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,061 INFO L225 Difference]: With dead ends: 367 [2020-12-23 01:41:47,061 INFO L226 Difference]: Without dead ends: 189 [2020-12-23 01:41:47,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-23 01:41:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2020-12-23 01:41:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 01:41:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 294 transitions. [2020-12-23 01:41:47,073 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 294 transitions. Word has length 24 [2020-12-23 01:41:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,074 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 294 transitions. [2020-12-23 01:41:47,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 294 transitions. [2020-12-23 01:41:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 01:41:47,075 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,076 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] [2020-12-23 01:41:47,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:41:47,076 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,077 INFO L82 PathProgramCache]: Analyzing trace with hash 688817562, now seen corresponding path program 1 times [2020-12-23 01:41:47,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362767723] [2020-12-23 01:41:47,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:47,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362767723] [2020-12-23 01:41:47,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:47,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224464972] [2020-12-23 01:41:47,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:47,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:47,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,125 INFO L87 Difference]: Start difference. First operand 187 states and 294 transitions. Second operand 3 states. [2020-12-23 01:41:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,269 INFO L93 Difference]: Finished difference Result 378 states and 589 transitions. [2020-12-23 01:41:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-12-23 01:41:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,272 INFO L225 Difference]: With dead ends: 378 [2020-12-23 01:41:47,272 INFO L226 Difference]: Without dead ends: 199 [2020-12-23 01:41:47,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-12-23 01:41:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2020-12-23 01:41:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 01:41:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 292 transitions. [2020-12-23 01:41:47,283 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 292 transitions. Word has length 25 [2020-12-23 01:41:47,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,283 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 292 transitions. [2020-12-23 01:41:47,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,284 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 292 transitions. [2020-12-23 01:41:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 01:41:47,285 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:47,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:41:47,286 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1643637293, now seen corresponding path program 1 times [2020-12-23 01:41:47,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074737618] [2020-12-23 01:41:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:47,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074737618] [2020-12-23 01:41:47,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:47,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948913833] [2020-12-23 01:41:47,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:47,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:47,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,335 INFO L87 Difference]: Start difference. First operand 187 states and 292 transitions. Second operand 3 states. [2020-12-23 01:41:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,475 INFO L93 Difference]: Finished difference Result 378 states and 585 transitions. [2020-12-23 01:41:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-12-23 01:41:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,478 INFO L225 Difference]: With dead ends: 378 [2020-12-23 01:41:47,478 INFO L226 Difference]: Without dead ends: 199 [2020-12-23 01:41:47,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-12-23 01:41:47,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2020-12-23 01:41:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 01:41:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 290 transitions. [2020-12-23 01:41:47,488 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 290 transitions. Word has length 26 [2020-12-23 01:41:47,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,489 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 290 transitions. [2020-12-23 01:41:47,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 290 transitions. [2020-12-23 01:41:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:41:47,490 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,490 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:47,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:41:47,491 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,491 INFO L82 PathProgramCache]: Analyzing trace with hash 807002645, now seen corresponding path program 1 times [2020-12-23 01:41:47,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822292255] [2020-12-23 01:41:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:47,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822292255] [2020-12-23 01:41:47,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:47,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991502231] [2020-12-23 01:41:47,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:47,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:47,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,552 INFO L87 Difference]: Start difference. First operand 187 states and 290 transitions. Second operand 3 states. [2020-12-23 01:41:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,715 INFO L93 Difference]: Finished difference Result 378 states and 581 transitions. [2020-12-23 01:41:47,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 01:41:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,717 INFO L225 Difference]: With dead ends: 378 [2020-12-23 01:41:47,717 INFO L226 Difference]: Without dead ends: 199 [2020-12-23 01:41:47,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-12-23 01:41:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2020-12-23 01:41:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 01:41:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 288 transitions. [2020-12-23 01:41:47,735 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 288 transitions. Word has length 27 [2020-12-23 01:41:47,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,738 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 288 transitions. [2020-12-23 01:41:47,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 288 transitions. [2020-12-23 01:41:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:41:47,741 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:47,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:41:47,741 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,745 INFO L82 PathProgramCache]: Analyzing trace with hash -583213996, now seen corresponding path program 1 times [2020-12-23 01:41:47,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955055352] [2020-12-23 01:41:47,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:47,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955055352] [2020-12-23 01:41:47,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:47,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166165966] [2020-12-23 01:41:47,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:47,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:47,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,826 INFO L87 Difference]: Start difference. First operand 187 states and 288 transitions. Second operand 3 states. [2020-12-23 01:41:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,850 INFO L93 Difference]: Finished difference Result 537 states and 823 transitions. [2020-12-23 01:41:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 01:41:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,854 INFO L225 Difference]: With dead ends: 537 [2020-12-23 01:41:47,854 INFO L226 Difference]: Without dead ends: 358 [2020-12-23 01:41:47,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-12-23 01:41:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2020-12-23 01:41:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2020-12-23 01:41:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 543 transitions. [2020-12-23 01:41:47,875 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 543 transitions. Word has length 27 [2020-12-23 01:41:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,877 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 543 transitions. [2020-12-23 01:41:47,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 543 transitions. [2020-12-23 01:41:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 01:41:47,879 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:47,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:41:47,880 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1263978570, now seen corresponding path program 1 times [2020-12-23 01:41:47,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520073481] [2020-12-23 01:41:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:47,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520073481] [2020-12-23 01:41:47,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:41:47,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475221641] [2020-12-23 01:41:47,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:41:47,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:41:47,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:41:47,976 INFO L87 Difference]: Start difference. First operand 356 states and 543 transitions. Second operand 4 states. [2020-12-23 01:41:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:48,299 INFO L93 Difference]: Finished difference Result 1100 states and 1680 transitions. [2020-12-23 01:41:48,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:41:48,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-12-23 01:41:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:48,304 INFO L225 Difference]: With dead ends: 1100 [2020-12-23 01:41:48,304 INFO L226 Difference]: Without dead ends: 753 [2020-12-23 01:41:48,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2020-12-23 01:41:48,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 599. [2020-12-23 01:41:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2020-12-23 01:41:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 928 transitions. [2020-12-23 01:41:48,346 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 928 transitions. Word has length 28 [2020-12-23 01:41:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:48,347 INFO L481 AbstractCegarLoop]: Abstraction has 599 states and 928 transitions. [2020-12-23 01:41:48,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:41:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 928 transitions. [2020-12-23 01:41:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 01:41:48,350 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:48,350 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] [2020-12-23 01:41:48,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:41:48,351 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash -737748410, now seen corresponding path program 1 times [2020-12-23 01:41:48,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:48,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157157695] [2020-12-23 01:41:48,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:48,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157157695] [2020-12-23 01:41:48,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:48,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:48,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440265899] [2020-12-23 01:41:48,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:48,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:48,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:48,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,395 INFO L87 Difference]: Start difference. First operand 599 states and 928 transitions. Second operand 3 states. [2020-12-23 01:41:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:48,631 INFO L93 Difference]: Finished difference Result 1331 states and 2092 transitions. [2020-12-23 01:41:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:48,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2020-12-23 01:41:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:48,639 INFO L225 Difference]: With dead ends: 1331 [2020-12-23 01:41:48,639 INFO L226 Difference]: Without dead ends: 741 [2020-12-23 01:41:48,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-23 01:41:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 721. [2020-12-23 01:41:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2020-12-23 01:41:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1143 transitions. [2020-12-23 01:41:48,678 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1143 transitions. Word has length 42 [2020-12-23 01:41:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:48,678 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 1143 transitions. [2020-12-23 01:41:48,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1143 transitions. [2020-12-23 01:41:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-23 01:41:48,680 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:48,680 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] [2020-12-23 01:41:48,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:41:48,681 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash 948641384, now seen corresponding path program 1 times [2020-12-23 01:41:48,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:48,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427588463] [2020-12-23 01:41:48,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:48,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427588463] [2020-12-23 01:41:48,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:48,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:48,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566921565] [2020-12-23 01:41:48,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:48,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:48,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:48,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,720 INFO L87 Difference]: Start difference. First operand 721 states and 1143 transitions. Second operand 3 states. [2020-12-23 01:41:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:48,935 INFO L93 Difference]: Finished difference Result 1498 states and 2392 transitions. [2020-12-23 01:41:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:48,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-12-23 01:41:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:48,940 INFO L225 Difference]: With dead ends: 1498 [2020-12-23 01:41:48,941 INFO L226 Difference]: Without dead ends: 786 [2020-12-23 01:41:48,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2020-12-23 01:41:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 766. [2020-12-23 01:41:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2020-12-23 01:41:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1228 transitions. [2020-12-23 01:41:48,975 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1228 transitions. Word has length 43 [2020-12-23 01:41:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:48,976 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 1228 transitions. [2020-12-23 01:41:48,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1228 transitions. [2020-12-23 01:41:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 01:41:48,978 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:48,978 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:41:48,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:41:48,978 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:48,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:48,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2093549194, now seen corresponding path program 1 times [2020-12-23 01:41:48,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:48,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31334369] [2020-12-23 01:41:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:49,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31334369] [2020-12-23 01:41:49,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888110028] [2020-12-23 01:41:49,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,012 INFO L87 Difference]: Start difference. First operand 766 states and 1228 transitions. Second operand 3 states. [2020-12-23 01:41:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:49,041 INFO L93 Difference]: Finished difference Result 1523 states and 2443 transitions. [2020-12-23 01:41:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:49,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-23 01:41:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:49,046 INFO L225 Difference]: With dead ends: 1523 [2020-12-23 01:41:49,046 INFO L226 Difference]: Without dead ends: 766 [2020-12-23 01:41:49,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2020-12-23 01:41:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2020-12-23 01:41:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2020-12-23 01:41:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1211 transitions. [2020-12-23 01:41:49,102 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1211 transitions. Word has length 44 [2020-12-23 01:41:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:49,103 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 1211 transitions. [2020-12-23 01:41:49,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1211 transitions. [2020-12-23 01:41:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:41:49,105 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:49,105 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:41:49,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:41:49,106 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:49,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:49,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1190502023, now seen corresponding path program 1 times [2020-12-23 01:41:49,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:49,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163728687] [2020-12-23 01:41:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:49,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163728687] [2020-12-23 01:41:49,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364569848] [2020-12-23 01:41:49,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,144 INFO L87 Difference]: Start difference. First operand 766 states and 1211 transitions. Second operand 3 states. [2020-12-23 01:41:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:49,194 INFO L93 Difference]: Finished difference Result 1537 states and 2426 transitions. [2020-12-23 01:41:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:49,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-23 01:41:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:49,200 INFO L225 Difference]: With dead ends: 1537 [2020-12-23 01:41:49,200 INFO L226 Difference]: Without dead ends: 780 [2020-12-23 01:41:49,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-12-23 01:41:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 778. [2020-12-23 01:41:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-12-23 01:41:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1209 transitions. [2020-12-23 01:41:49,243 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1209 transitions. Word has length 45 [2020-12-23 01:41:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:49,243 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 1209 transitions. [2020-12-23 01:41:49,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1209 transitions. [2020-12-23 01:41:49,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 01:41:49,245 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:49,246 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:49,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:41:49,246 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:49,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:49,247 INFO L82 PathProgramCache]: Analyzing trace with hash -881523047, now seen corresponding path program 1 times [2020-12-23 01:41:49,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:49,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051209019] [2020-12-23 01:41:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:49,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051209019] [2020-12-23 01:41:49,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83704904] [2020-12-23 01:41:49,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,284 INFO L87 Difference]: Start difference. First operand 778 states and 1209 transitions. Second operand 3 states. [2020-12-23 01:41:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:49,344 INFO L93 Difference]: Finished difference Result 2299 states and 3573 transitions. [2020-12-23 01:41:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:49,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-23 01:41:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:49,353 INFO L225 Difference]: With dead ends: 2299 [2020-12-23 01:41:49,354 INFO L226 Difference]: Without dead ends: 1530 [2020-12-23 01:41:49,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2020-12-23 01:41:49,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1218. [2020-12-23 01:41:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2020-12-23 01:41:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1885 transitions. [2020-12-23 01:41:49,414 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1885 transitions. Word has length 50 [2020-12-23 01:41:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:49,414 INFO L481 AbstractCegarLoop]: Abstraction has 1218 states and 1885 transitions. [2020-12-23 01:41:49,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1885 transitions. [2020-12-23 01:41:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 01:41:49,417 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:49,417 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:49,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:41:49,417 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:49,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:49,418 INFO L82 PathProgramCache]: Analyzing trace with hash 11963291, now seen corresponding path program 1 times [2020-12-23 01:41:49,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:49,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077599495] [2020-12-23 01:41:49,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:49,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077599495] [2020-12-23 01:41:49,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431627427] [2020-12-23 01:41:49,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,483 INFO L87 Difference]: Start difference. First operand 1218 states and 1885 transitions. Second operand 3 states. [2020-12-23 01:41:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:49,766 INFO L93 Difference]: Finished difference Result 2639 states and 4073 transitions. [2020-12-23 01:41:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:49,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-23 01:41:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:49,774 INFO L225 Difference]: With dead ends: 2639 [2020-12-23 01:41:49,774 INFO L226 Difference]: Without dead ends: 1431 [2020-12-23 01:41:49,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-12-23 01:41:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1325. [2020-12-23 01:41:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2020-12-23 01:41:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2000 transitions. [2020-12-23 01:41:49,839 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2000 transitions. Word has length 50 [2020-12-23 01:41:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:49,839 INFO L481 AbstractCegarLoop]: Abstraction has 1325 states and 2000 transitions. [2020-12-23 01:41:49,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2000 transitions. [2020-12-23 01:41:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 01:41:49,841 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:49,842 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:49,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:41:49,842 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:49,843 INFO L82 PathProgramCache]: Analyzing trace with hash 776292063, now seen corresponding path program 1 times [2020-12-23 01:41:49,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:49,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056061784] [2020-12-23 01:41:49,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:41:49,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056061784] [2020-12-23 01:41:49,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049619878] [2020-12-23 01:41:49,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,891 INFO L87 Difference]: Start difference. First operand 1325 states and 2000 transitions. Second operand 3 states. [2020-12-23 01:41:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:50,106 INFO L93 Difference]: Finished difference Result 2808 states and 4234 transitions. [2020-12-23 01:41:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:50,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-12-23 01:41:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:50,113 INFO L225 Difference]: With dead ends: 2808 [2020-12-23 01:41:50,114 INFO L226 Difference]: Without dead ends: 1493 [2020-12-23 01:41:50,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2020-12-23 01:41:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1451. [2020-12-23 01:41:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2020-12-23 01:41:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2137 transitions. [2020-12-23 01:41:50,181 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2137 transitions. Word has length 55 [2020-12-23 01:41:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:50,181 INFO L481 AbstractCegarLoop]: Abstraction has 1451 states and 2137 transitions. [2020-12-23 01:41:50,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2137 transitions. [2020-12-23 01:41:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 01:41:50,184 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:50,184 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:50,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:41:50,184 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:50,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1456350433, now seen corresponding path program 1 times [2020-12-23 01:41:50,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:50,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068528579] [2020-12-23 01:41:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 01:41:50,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068528579] [2020-12-23 01:41:50,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:50,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:50,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696176368] [2020-12-23 01:41:50,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:50,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:50,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,231 INFO L87 Difference]: Start difference. First operand 1451 states and 2137 transitions. Second operand 3 states. [2020-12-23 01:41:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:50,301 INFO L93 Difference]: Finished difference Result 2739 states and 4009 transitions. [2020-12-23 01:41:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:50,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-12-23 01:41:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:50,310 INFO L225 Difference]: With dead ends: 2739 [2020-12-23 01:41:50,311 INFO L226 Difference]: Without dead ends: 1828 [2020-12-23 01:41:50,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2020-12-23 01:41:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1313. [2020-12-23 01:41:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2020-12-23 01:41:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1919 transitions. [2020-12-23 01:41:50,420 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1919 transitions. Word has length 55 [2020-12-23 01:41:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:50,420 INFO L481 AbstractCegarLoop]: Abstraction has 1313 states and 1919 transitions. [2020-12-23 01:41:50,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1919 transitions. [2020-12-23 01:41:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 01:41:50,423 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:50,423 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:50,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:41:50,424 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:50,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:50,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1301716177, now seen corresponding path program 1 times [2020-12-23 01:41:50,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:50,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362491668] [2020-12-23 01:41:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:50,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362491668] [2020-12-23 01:41:50,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:50,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:50,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752136291] [2020-12-23 01:41:50,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:50,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:50,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:50,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,496 INFO L87 Difference]: Start difference. First operand 1313 states and 1919 transitions. Second operand 3 states. [2020-12-23 01:41:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:50,590 INFO L93 Difference]: Finished difference Result 3800 states and 5511 transitions. [2020-12-23 01:41:50,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:50,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-12-23 01:41:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:50,602 INFO L225 Difference]: With dead ends: 3800 [2020-12-23 01:41:50,602 INFO L226 Difference]: Without dead ends: 2497 [2020-12-23 01:41:50,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2020-12-23 01:41:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2495. [2020-12-23 01:41:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2020-12-23 01:41:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3572 transitions. [2020-12-23 01:41:50,711 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3572 transitions. Word has length 56 [2020-12-23 01:41:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:50,712 INFO L481 AbstractCegarLoop]: Abstraction has 2495 states and 3572 transitions. [2020-12-23 01:41:50,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3572 transitions. [2020-12-23 01:41:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-23 01:41:50,716 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:50,717 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:50,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:41:50,717 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:50,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:50,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1196163616, now seen corresponding path program 1 times [2020-12-23 01:41:50,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:50,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700293370] [2020-12-23 01:41:50,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:41:50,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:41:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:41:50,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:41:50,823 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:41:50,823 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:41:50,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:41:50,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:41:50 BoogieIcfgContainer [2020-12-23 01:41:50,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:41:50,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:41:50,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:41:50,945 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:41:50,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:45" (3/4) ... [2020-12-23 01:41:50,949 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 01:41:51,060 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_srvr_14.cil.c-witness.graphml [2020-12-23 01:41:51,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:41:51,063 INFO L168 Benchmark]: Toolchain (without parser) took 7745.93 ms. Allocated memory was 152.0 MB in the beginning and 245.4 MB in the end (delta: 93.3 MB). Free memory was 127.0 MB in the beginning and 98.5 MB in the end (delta: 28.5 MB). Peak memory consumption was 122.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:51,064 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 152.0 MB. Free memory is still 127.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:41:51,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.73 ms. Allocated memory is still 152.0 MB. Free memory was 127.0 MB in the beginning and 111.6 MB in the end (delta: 15.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:51,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.99 ms. Allocated memory is still 152.0 MB. Free memory was 111.3 MB in the beginning and 108.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:51,065 INFO L168 Benchmark]: Boogie Preprocessor took 49.45 ms. Allocated memory is still 152.0 MB. Free memory was 108.4 MB in the beginning and 106.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:51,066 INFO L168 Benchmark]: RCFGBuilder took 1111.33 ms. Allocated memory is still 152.0 MB. Free memory was 106.3 MB in the beginning and 88.4 MB in the end (delta: 17.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:51,071 INFO L168 Benchmark]: TraceAbstraction took 5839.90 ms. Allocated memory was 152.0 MB in the beginning and 245.4 MB in the end (delta: 93.3 MB). Free memory was 87.9 MB in the beginning and 106.9 MB in the end (delta: -19.0 MB). Peak memory consumption was 74.3 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:51,072 INFO L168 Benchmark]: Witness Printer took 115.99 ms. Allocated memory is still 245.4 MB. Free memory was 106.9 MB in the beginning and 98.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:51,074 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.17 ms. Allocated memory is still 152.0 MB. Free memory is still 127.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 547.73 ms. Allocated memory is still 152.0 MB. Free memory was 127.0 MB in the beginning and 111.6 MB in the end (delta: 15.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 70.99 ms. Allocated memory is still 152.0 MB. Free memory was 111.3 MB in the beginning and 108.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 49.45 ms. Allocated memory is still 152.0 MB. Free memory was 108.4 MB in the beginning and 106.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1111.33 ms. Allocated memory is still 152.0 MB. Free memory was 106.3 MB in the beginning and 88.4 MB in the end (delta: 17.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5839.90 ms. Allocated memory was 152.0 MB in the beginning and 245.4 MB in the end (delta: 93.3 MB). Free memory was 87.9 MB in the beginning and 106.9 MB in the end (delta: -19.0 MB). Peak memory consumption was 74.3 MB. Max. memory is 8.0 GB. * Witness Printer took 115.99 ms. Allocated memory is still 245.4 MB. Free memory was 106.9 MB in the beginning and 98.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 642]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L647] int s ; [L648] int tmp ; [L652] s = 8464 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 = 1; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__cert = __VERIFIER_nondet_int() ; [L27] int s__options = __VERIFIER_nondet_int() ; [L28] int s__verify_mode = __VERIFIER_nondet_int() ; [L29] int s__session__peer = __VERIFIER_nondet_int() ; [L30] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L31] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__cert_request ; [L36] int s__s3__tmp__reuse_message ; [L37] int s__s3__tmp__use_rsa_tmp ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms = __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 ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp ; [L47] int cb ; [L48] long num1 = __VERIFIER_nondet_long() ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int got_new_session ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int tmp___10 = __VERIFIER_nondet_int() ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] unsigned long __cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 ; [L69] unsigned long __cil_tmp59 ; [L70] int __cil_tmp60 ; [L71] unsigned long __cil_tmp61 ; [L74] s__s3__tmp__reuse_message = 0 [L75] s__state = initial_state [L76] blastFlag = 0 [L77] tmp = __VERIFIER_nondet_int() [L78] Time = tmp [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] got_new_session = 0 [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback [L90] s__in_handshake ++ [L91] COND TRUE tmp___1 + 12288 [L92] COND TRUE tmp___2 + 16384 [L96] COND FALSE !(s__cert == 0) [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND TRUE s__state == 8464 [L273] s__shutdown = 0 [L274] ret = __VERIFIER_nondet_int() [L275] COND TRUE blastFlag == 0 [L276] blastFlag = 1 [L278] COND FALSE !(ret <= 0) [L281] got_new_session = 1 [L282] s__state = 8496 [L283] s__init_num = 0 [L604] COND TRUE ! s__s3__tmp__reuse_message [L605] COND TRUE ! skip [L606] COND TRUE tmp___1 != -12288 [L607] COND TRUE s__state != 8656 [L608] COND TRUE tmp___2 != -16384 [L609] COND FALSE !(state == 8496) [L616] COND FALSE !(\read(s__debug)) [L622] COND TRUE cb != 0 [L623] COND TRUE s__state != state [L624] new_state = s__state [L625] s__state = state [L626] s__state = new_state [L631] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND TRUE s__state == 8496 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L291] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 8512 [L299] s__init_num = 0 [L604] COND TRUE ! s__s3__tmp__reuse_message [L605] COND TRUE ! skip [L606] COND TRUE tmp___1 != -12288 [L607] COND TRUE s__state != 8656 [L608] COND TRUE tmp___2 != -16384 [L609] COND TRUE state == 8496 [L642] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.6s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3676 SDtfs, 3347 SDslu, 1453 SDs, 0 SdLazy, 1205 SolverSat, 447 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2495occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 1223 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 650 ConstructedInterpolants, 0 QuantifiedInterpolants, 76611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 118/118 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...