/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-178dd20 [2021-01-06 11:35:28,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:35:28,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:35:28,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:35:28,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:35:28,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:35:28,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:35:28,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:35:28,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:35:28,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:35:28,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:35:28,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:35:28,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:35:28,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:35:28,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:35:28,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:35:28,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:35:28,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:35:28,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:35:28,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:35:28,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:35:28,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:35:28,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:35:28,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:35:28,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:35:28,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:35:28,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:35:28,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:35:28,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:35:28,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:35:28,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:35:28,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:35:28,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:35:28,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:35:28,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:35:28,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:35:28,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:35:28,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:35:28,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:35:28,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:35:28,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:35:28,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:35:28,236 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:35:28,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:35:28,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:35:28,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:35:28,239 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:35:28,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:35:28,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:35:28,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:35:28,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:35:28,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:35:28,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:35:28,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:35:28,241 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:35:28,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:35:28,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:35:28,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:35:28,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:35:28,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:35:28,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:35:28,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:35:28,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:35:28,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:35:28,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:35:28,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:35:28,244 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:35:28,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 11:35:28,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:35:28,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:35:28,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:35:28,681 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:35:28,682 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:35:28,683 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 [2021-01-06 11:35:28,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/96185f2fa/eba3607bd6f64d57a7708d0279e843d4/FLAG976303118 [2021-01-06 11:35:29,466 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:35:29,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_14.cil.c [2021-01-06 11:35:29,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/96185f2fa/eba3607bd6f64d57a7708d0279e843d4/FLAG976303118 [2021-01-06 11:35:29,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/96185f2fa/eba3607bd6f64d57a7708d0279e843d4 [2021-01-06 11:35:29,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:35:29,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:35:29,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:29,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:35:29,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:35:29,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:29" (1/1) ... [2021-01-06 11:35:29,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f52473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:29, skipping insertion in model container [2021-01-06 11:35:29,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:29" (1/1) ... [2021-01-06 11:35:29,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:35:29,772 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,] [2021-01-06 11:35:30,026 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,] [2021-01-06 11:35:30,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:30,048 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,] [2021-01-06 11:35:30,123 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,] [2021-01-06 11:35:30,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:30,146 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:35:30,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30 WrapperNode [2021-01-06 11:35:30,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:30,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:30,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:35:30,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:35:30,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30" (1/1) ... [2021-01-06 11:35:30,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30" (1/1) ... [2021-01-06 11:35:30,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:30,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:35:30,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:35:30,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:35:30,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30" (1/1) ... [2021-01-06 11:35:30,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30" (1/1) ... [2021-01-06 11:35:30,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30" (1/1) ... [2021-01-06 11:35:30,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30" (1/1) ... [2021-01-06 11:35:30,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30" (1/1) ... [2021-01-06 11:35:30,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30" (1/1) ... [2021-01-06 11:35:30,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30" (1/1) ... [2021-01-06 11:35:30,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:35:30,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:35:30,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:35:30,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:35:30,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:35:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:35:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:35:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:35:30,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:35:30,772 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:35:31,782 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-01-06 11:35:31,782 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-01-06 11:35:31,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:35:31,795 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:35:31,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:31 BoogieIcfgContainer [2021-01-06 11:35:31,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:35:31,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:35:31,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:35:31,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:35:31,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:35:29" (1/3) ... [2021-01-06 11:35:31,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75799e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:31, skipping insertion in model container [2021-01-06 11:35:31,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:30" (2/3) ... [2021-01-06 11:35:31,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75799e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:31, skipping insertion in model container [2021-01-06 11:35:31,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:31" (3/3) ... [2021-01-06 11:35:31,809 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2021-01-06 11:35:31,817 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:35:31,823 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:35:31,845 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:35:31,878 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:35:31,878 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:35:31,878 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:35:31,879 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:35:31,879 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:35:31,879 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:35:31,879 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:35:31,879 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:35:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2021-01-06 11:35:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 11:35:31,910 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:31,911 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] [2021-01-06 11:35:31,911 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:31,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1180429726, now seen corresponding path program 1 times [2021-01-06 11:35:31,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:31,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242756994] [2021-01-06 11:35:31,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:32,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242756994] [2021-01-06 11:35:32,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:32,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:32,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776942161] [2021-01-06 11:35:32,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:32,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:32,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:32,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:32,231 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 3 states. [2021-01-06 11:35:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:32,590 INFO L93 Difference]: Finished difference Result 324 states and 556 transitions. [2021-01-06 11:35:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:32,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-01-06 11:35:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:32,617 INFO L225 Difference]: With dead ends: 324 [2021-01-06 11:35:32,618 INFO L226 Difference]: Without dead ends: 161 [2021-01-06 11:35:32,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-01-06 11:35:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2021-01-06 11:35:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2021-01-06 11:35:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2021-01-06 11:35:32,675 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 23 [2021-01-06 11:35:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:32,675 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 249 transitions. [2021-01-06 11:35:32,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 249 transitions. [2021-01-06 11:35:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 11:35:32,677 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:32,678 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] [2021-01-06 11:35:32,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:35:32,678 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:32,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:32,684 INFO L82 PathProgramCache]: Analyzing trace with hash -932054356, now seen corresponding path program 1 times [2021-01-06 11:35:32,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:32,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614821026] [2021-01-06 11:35:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:32,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614821026] [2021-01-06 11:35:32,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:32,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:32,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483172373] [2021-01-06 11:35:32,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:32,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:32,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:32,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:32,801 INFO L87 Difference]: Start difference. First operand 157 states and 249 transitions. Second operand 3 states. [2021-01-06 11:35:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:33,062 INFO L93 Difference]: Finished difference Result 331 states and 523 transitions. [2021-01-06 11:35:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:33,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-01-06 11:35:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:33,067 INFO L225 Difference]: With dead ends: 331 [2021-01-06 11:35:33,068 INFO L226 Difference]: Without dead ends: 182 [2021-01-06 11:35:33,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-01-06 11:35:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2021-01-06 11:35:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2021-01-06 11:35:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 282 transitions. [2021-01-06 11:35:33,089 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 282 transitions. Word has length 24 [2021-01-06 11:35:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:33,095 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 282 transitions. [2021-01-06 11:35:33,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 282 transitions. [2021-01-06 11:35:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 11:35:33,100 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:33,101 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] [2021-01-06 11:35:33,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:35:33,101 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:33,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:33,102 INFO L82 PathProgramCache]: Analyzing trace with hash -945010985, now seen corresponding path program 1 times [2021-01-06 11:35:33,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:33,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999995253] [2021-01-06 11:35:33,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:33,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999995253] [2021-01-06 11:35:33,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:33,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:33,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500405009] [2021-01-06 11:35:33,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:33,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:33,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:33,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:33,216 INFO L87 Difference]: Start difference. First operand 180 states and 282 transitions. Second operand 3 states. [2021-01-06 11:35:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:33,445 INFO L93 Difference]: Finished difference Result 362 states and 567 transitions. [2021-01-06 11:35:33,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:33,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-01-06 11:35:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:33,450 INFO L225 Difference]: With dead ends: 362 [2021-01-06 11:35:33,451 INFO L226 Difference]: Without dead ends: 190 [2021-01-06 11:35:33,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-01-06 11:35:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2021-01-06 11:35:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2021-01-06 11:35:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2021-01-06 11:35:33,498 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 24 [2021-01-06 11:35:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:33,501 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2021-01-06 11:35:33,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2021-01-06 11:35:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 11:35:33,503 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:33,503 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] [2021-01-06 11:35:33,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:35:33,504 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1648361961, now seen corresponding path program 1 times [2021-01-06 11:35:33,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:33,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611519283] [2021-01-06 11:35:33,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:33,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611519283] [2021-01-06 11:35:33,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:33,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:33,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329723831] [2021-01-06 11:35:33,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:33,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:33,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:33,612 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand 3 states. [2021-01-06 11:35:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:33,851 INFO L93 Difference]: Finished difference Result 367 states and 577 transitions. [2021-01-06 11:35:33,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:33,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-01-06 11:35:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:33,854 INFO L225 Difference]: With dead ends: 367 [2021-01-06 11:35:33,854 INFO L226 Difference]: Without dead ends: 189 [2021-01-06 11:35:33,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-06 11:35:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2021-01-06 11:35:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-01-06 11:35:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 294 transitions. [2021-01-06 11:35:33,890 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 294 transitions. Word has length 24 [2021-01-06 11:35:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:33,890 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 294 transitions. [2021-01-06 11:35:33,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 294 transitions. [2021-01-06 11:35:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 11:35:33,892 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:33,893 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] [2021-01-06 11:35:33,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:35:33,893 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:33,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash 688817562, now seen corresponding path program 1 times [2021-01-06 11:35:33,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:33,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269660099] [2021-01-06 11:35:33,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:33,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269660099] [2021-01-06 11:35:33,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:33,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:33,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221497391] [2021-01-06 11:35:33,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:33,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:33,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:33,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:33,997 INFO L87 Difference]: Start difference. First operand 187 states and 294 transitions. Second operand 3 states. [2021-01-06 11:35:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:34,163 INFO L93 Difference]: Finished difference Result 378 states and 589 transitions. [2021-01-06 11:35:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:34,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-01-06 11:35:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:34,166 INFO L225 Difference]: With dead ends: 378 [2021-01-06 11:35:34,166 INFO L226 Difference]: Without dead ends: 199 [2021-01-06 11:35:34,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-01-06 11:35:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2021-01-06 11:35:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-01-06 11:35:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 292 transitions. [2021-01-06 11:35:34,176 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 292 transitions. Word has length 25 [2021-01-06 11:35:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:34,177 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 292 transitions. [2021-01-06 11:35:34,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 292 transitions. [2021-01-06 11:35:34,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 11:35:34,178 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:34,178 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] [2021-01-06 11:35:34,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:35:34,179 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:34,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:34,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1643637293, now seen corresponding path program 1 times [2021-01-06 11:35:34,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:34,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105129452] [2021-01-06 11:35:34,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:34,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105129452] [2021-01-06 11:35:34,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:34,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:34,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401680255] [2021-01-06 11:35:34,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:34,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:34,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:34,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:34,221 INFO L87 Difference]: Start difference. First operand 187 states and 292 transitions. Second operand 3 states. [2021-01-06 11:35:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:34,399 INFO L93 Difference]: Finished difference Result 378 states and 585 transitions. [2021-01-06 11:35:34,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:34,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-01-06 11:35:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:34,401 INFO L225 Difference]: With dead ends: 378 [2021-01-06 11:35:34,401 INFO L226 Difference]: Without dead ends: 199 [2021-01-06 11:35:34,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-01-06 11:35:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2021-01-06 11:35:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-01-06 11:35:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 290 transitions. [2021-01-06 11:35:34,412 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 290 transitions. Word has length 26 [2021-01-06 11:35:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:34,412 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 290 transitions. [2021-01-06 11:35:34,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 290 transitions. [2021-01-06 11:35:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:35:34,413 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:34,414 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] [2021-01-06 11:35:34,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:35:34,414 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash 807002645, now seen corresponding path program 1 times [2021-01-06 11:35:34,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:34,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634003600] [2021-01-06 11:35:34,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:34,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634003600] [2021-01-06 11:35:34,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:34,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:34,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804175613] [2021-01-06 11:35:34,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:34,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:34,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:34,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:34,456 INFO L87 Difference]: Start difference. First operand 187 states and 290 transitions. Second operand 3 states. [2021-01-06 11:35:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:34,621 INFO L93 Difference]: Finished difference Result 378 states and 581 transitions. [2021-01-06 11:35:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:34,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-06 11:35:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:34,623 INFO L225 Difference]: With dead ends: 378 [2021-01-06 11:35:34,623 INFO L226 Difference]: Without dead ends: 199 [2021-01-06 11:35:34,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-01-06 11:35:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2021-01-06 11:35:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-01-06 11:35:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 288 transitions. [2021-01-06 11:35:34,634 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 288 transitions. Word has length 27 [2021-01-06 11:35:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:34,637 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 288 transitions. [2021-01-06 11:35:34,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 288 transitions. [2021-01-06 11:35:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:35:34,643 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:34,644 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] [2021-01-06 11:35:34,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:35:34,644 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash -583213996, now seen corresponding path program 1 times [2021-01-06 11:35:34,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:34,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142538790] [2021-01-06 11:35:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:34,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142538790] [2021-01-06 11:35:34,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:34,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:34,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644378885] [2021-01-06 11:35:34,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:34,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:34,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:34,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:34,711 INFO L87 Difference]: Start difference. First operand 187 states and 288 transitions. Second operand 3 states. [2021-01-06 11:35:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:34,740 INFO L93 Difference]: Finished difference Result 537 states and 823 transitions. [2021-01-06 11:35:34,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:34,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-06 11:35:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:34,744 INFO L225 Difference]: With dead ends: 537 [2021-01-06 11:35:34,744 INFO L226 Difference]: Without dead ends: 358 [2021-01-06 11:35:34,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-01-06 11:35:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2021-01-06 11:35:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2021-01-06 11:35:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 543 transitions. [2021-01-06 11:35:34,771 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 543 transitions. Word has length 27 [2021-01-06 11:35:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:34,771 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 543 transitions. [2021-01-06 11:35:34,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 543 transitions. [2021-01-06 11:35:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 11:35:34,772 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:34,773 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] [2021-01-06 11:35:34,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:35:34,773 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:34,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:34,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1263978570, now seen corresponding path program 1 times [2021-01-06 11:35:34,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:34,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79004464] [2021-01-06 11:35:34,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:34,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79004464] [2021-01-06 11:35:34,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:34,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:35:34,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638469031] [2021-01-06 11:35:34,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:35:34,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:34,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:35:34,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:35:34,827 INFO L87 Difference]: Start difference. First operand 356 states and 543 transitions. Second operand 4 states. [2021-01-06 11:35:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:35,148 INFO L93 Difference]: Finished difference Result 1100 states and 1680 transitions. [2021-01-06 11:35:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:35:35,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2021-01-06 11:35:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:35,154 INFO L225 Difference]: With dead ends: 1100 [2021-01-06 11:35:35,154 INFO L226 Difference]: Without dead ends: 753 [2021-01-06 11:35:35,156 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 [2021-01-06 11:35:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2021-01-06 11:35:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 599. [2021-01-06 11:35:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2021-01-06 11:35:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 928 transitions. [2021-01-06 11:35:35,187 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 928 transitions. Word has length 28 [2021-01-06 11:35:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:35,187 INFO L481 AbstractCegarLoop]: Abstraction has 599 states and 928 transitions. [2021-01-06 11:35:35,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:35:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 928 transitions. [2021-01-06 11:35:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 11:35:35,189 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:35,189 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] [2021-01-06 11:35:35,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:35:35,190 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:35,190 INFO L82 PathProgramCache]: Analyzing trace with hash -737748410, now seen corresponding path program 1 times [2021-01-06 11:35:35,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:35,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529656215] [2021-01-06 11:35:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:35,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529656215] [2021-01-06 11:35:35,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:35,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:35,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397346699] [2021-01-06 11:35:35,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:35,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:35,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:35,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:35,235 INFO L87 Difference]: Start difference. First operand 599 states and 928 transitions. Second operand 3 states. [2021-01-06 11:35:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:35,463 INFO L93 Difference]: Finished difference Result 1331 states and 2092 transitions. [2021-01-06 11:35:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:35,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2021-01-06 11:35:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:35,469 INFO L225 Difference]: With dead ends: 1331 [2021-01-06 11:35:35,469 INFO L226 Difference]: Without dead ends: 741 [2021-01-06 11:35:35,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2021-01-06 11:35:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 721. [2021-01-06 11:35:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2021-01-06 11:35:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1143 transitions. [2021-01-06 11:35:35,506 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1143 transitions. Word has length 42 [2021-01-06 11:35:35,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:35,507 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 1143 transitions. [2021-01-06 11:35:35,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1143 transitions. [2021-01-06 11:35:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 11:35:35,508 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:35,509 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] [2021-01-06 11:35:35,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:35:35,509 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:35,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash 948641384, now seen corresponding path program 1 times [2021-01-06 11:35:35,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:35,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909299608] [2021-01-06 11:35:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:35,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909299608] [2021-01-06 11:35:35,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:35,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:35,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501060543] [2021-01-06 11:35:35,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:35,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:35,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:35,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:35,552 INFO L87 Difference]: Start difference. First operand 721 states and 1143 transitions. Second operand 3 states. [2021-01-06 11:35:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:35,755 INFO L93 Difference]: Finished difference Result 1498 states and 2392 transitions. [2021-01-06 11:35:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:35,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2021-01-06 11:35:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:35,761 INFO L225 Difference]: With dead ends: 1498 [2021-01-06 11:35:35,761 INFO L226 Difference]: Without dead ends: 786 [2021-01-06 11:35:35,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2021-01-06 11:35:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 766. [2021-01-06 11:35:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2021-01-06 11:35:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1228 transitions. [2021-01-06 11:35:35,813 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1228 transitions. Word has length 43 [2021-01-06 11:35:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:35,814 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 1228 transitions. [2021-01-06 11:35:35,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1228 transitions. [2021-01-06 11:35:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:35:35,816 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:35,816 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] [2021-01-06 11:35:35,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:35:35,816 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:35,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2093549194, now seen corresponding path program 1 times [2021-01-06 11:35:35,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:35,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505385199] [2021-01-06 11:35:35,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:35,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505385199] [2021-01-06 11:35:35,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:35,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:35,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284088514] [2021-01-06 11:35:35,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:35,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:35,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:35,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:35,865 INFO L87 Difference]: Start difference. First operand 766 states and 1228 transitions. Second operand 3 states. [2021-01-06 11:35:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:35,897 INFO L93 Difference]: Finished difference Result 1523 states and 2443 transitions. [2021-01-06 11:35:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:35,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 11:35:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:35,905 INFO L225 Difference]: With dead ends: 1523 [2021-01-06 11:35:35,905 INFO L226 Difference]: Without dead ends: 766 [2021-01-06 11:35:35,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2021-01-06 11:35:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2021-01-06 11:35:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2021-01-06 11:35:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1211 transitions. [2021-01-06 11:35:35,954 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1211 transitions. Word has length 44 [2021-01-06 11:35:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:35,955 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 1211 transitions. [2021-01-06 11:35:35,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1211 transitions. [2021-01-06 11:35:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:35:35,957 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:35,957 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] [2021-01-06 11:35:35,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:35:35,957 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:35,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:35,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1190502023, now seen corresponding path program 1 times [2021-01-06 11:35:35,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:35,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320320595] [2021-01-06 11:35:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:36,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320320595] [2021-01-06 11:35:36,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:36,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:36,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702091077] [2021-01-06 11:35:36,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:36,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:36,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:36,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:36,029 INFO L87 Difference]: Start difference. First operand 766 states and 1211 transitions. Second operand 3 states. [2021-01-06 11:35:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:36,078 INFO L93 Difference]: Finished difference Result 1537 states and 2426 transitions. [2021-01-06 11:35:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:36,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2021-01-06 11:35:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:36,083 INFO L225 Difference]: With dead ends: 1537 [2021-01-06 11:35:36,083 INFO L226 Difference]: Without dead ends: 780 [2021-01-06 11:35:36,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-01-06 11:35:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 778. [2021-01-06 11:35:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2021-01-06 11:35:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1209 transitions. [2021-01-06 11:35:36,123 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1209 transitions. Word has length 45 [2021-01-06 11:35:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:36,124 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 1209 transitions. [2021-01-06 11:35:36,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1209 transitions. [2021-01-06 11:35:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 11:35:36,128 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:36,129 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] [2021-01-06 11:35:36,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:35:36,129 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:36,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:36,130 INFO L82 PathProgramCache]: Analyzing trace with hash -881523047, now seen corresponding path program 1 times [2021-01-06 11:35:36,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:36,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314679249] [2021-01-06 11:35:36,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:36,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314679249] [2021-01-06 11:35:36,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:36,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:36,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700418214] [2021-01-06 11:35:36,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:36,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:36,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:36,189 INFO L87 Difference]: Start difference. First operand 778 states and 1209 transitions. Second operand 3 states. [2021-01-06 11:35:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:36,248 INFO L93 Difference]: Finished difference Result 2299 states and 3573 transitions. [2021-01-06 11:35:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:36,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2021-01-06 11:35:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:36,257 INFO L225 Difference]: With dead ends: 2299 [2021-01-06 11:35:36,257 INFO L226 Difference]: Without dead ends: 1530 [2021-01-06 11:35:36,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:36,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2021-01-06 11:35:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1218. [2021-01-06 11:35:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2021-01-06 11:35:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1885 transitions. [2021-01-06 11:35:36,327 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1885 transitions. Word has length 50 [2021-01-06 11:35:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:36,327 INFO L481 AbstractCegarLoop]: Abstraction has 1218 states and 1885 transitions. [2021-01-06 11:35:36,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1885 transitions. [2021-01-06 11:35:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 11:35:36,329 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:36,329 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] [2021-01-06 11:35:36,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:35:36,330 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:36,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash 11963291, now seen corresponding path program 1 times [2021-01-06 11:35:36,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:36,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746884877] [2021-01-06 11:35:36,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:36,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746884877] [2021-01-06 11:35:36,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:36,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:36,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473086434] [2021-01-06 11:35:36,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:36,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:36,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:36,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:36,388 INFO L87 Difference]: Start difference. First operand 1218 states and 1885 transitions. Second operand 3 states. [2021-01-06 11:35:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:36,671 INFO L93 Difference]: Finished difference Result 2639 states and 4073 transitions. [2021-01-06 11:35:36,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:36,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2021-01-06 11:35:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:36,679 INFO L225 Difference]: With dead ends: 2639 [2021-01-06 11:35:36,680 INFO L226 Difference]: Without dead ends: 1431 [2021-01-06 11:35:36,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2021-01-06 11:35:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1325. [2021-01-06 11:35:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2021-01-06 11:35:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2000 transitions. [2021-01-06 11:35:36,749 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2000 transitions. Word has length 50 [2021-01-06 11:35:36,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:36,749 INFO L481 AbstractCegarLoop]: Abstraction has 1325 states and 2000 transitions. [2021-01-06 11:35:36,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2000 transitions. [2021-01-06 11:35:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 11:35:36,752 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:36,753 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] [2021-01-06 11:35:36,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:35:36,753 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:36,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash 776292063, now seen corresponding path program 1 times [2021-01-06 11:35:36,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:36,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769343852] [2021-01-06 11:35:36,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:35:36,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769343852] [2021-01-06 11:35:36,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:36,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:36,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341939671] [2021-01-06 11:35:36,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:36,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:36,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:36,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:36,800 INFO L87 Difference]: Start difference. First operand 1325 states and 2000 transitions. Second operand 3 states. [2021-01-06 11:35:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:37,032 INFO L93 Difference]: Finished difference Result 2808 states and 4234 transitions. [2021-01-06 11:35:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:37,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2021-01-06 11:35:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:37,040 INFO L225 Difference]: With dead ends: 2808 [2021-01-06 11:35:37,041 INFO L226 Difference]: Without dead ends: 1493 [2021-01-06 11:35:37,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2021-01-06 11:35:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1451. [2021-01-06 11:35:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2021-01-06 11:35:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2137 transitions. [2021-01-06 11:35:37,131 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2137 transitions. Word has length 55 [2021-01-06 11:35:37,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:37,132 INFO L481 AbstractCegarLoop]: Abstraction has 1451 states and 2137 transitions. [2021-01-06 11:35:37,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2137 transitions. [2021-01-06 11:35:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 11:35:37,135 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:37,136 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] [2021-01-06 11:35:37,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:35:37,136 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:37,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:37,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1456350433, now seen corresponding path program 1 times [2021-01-06 11:35:37,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:37,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140591759] [2021-01-06 11:35:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 11:35:37,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140591759] [2021-01-06 11:35:37,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:37,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:37,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552660035] [2021-01-06 11:35:37,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:37,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:37,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:37,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:37,196 INFO L87 Difference]: Start difference. First operand 1451 states and 2137 transitions. Second operand 3 states. [2021-01-06 11:35:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:37,293 INFO L93 Difference]: Finished difference Result 2739 states and 4009 transitions. [2021-01-06 11:35:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:37,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2021-01-06 11:35:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:37,306 INFO L225 Difference]: With dead ends: 2739 [2021-01-06 11:35:37,306 INFO L226 Difference]: Without dead ends: 1828 [2021-01-06 11:35:37,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:37,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2021-01-06 11:35:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1313. [2021-01-06 11:35:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2021-01-06 11:35:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1919 transitions. [2021-01-06 11:35:37,404 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1919 transitions. Word has length 55 [2021-01-06 11:35:37,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:37,404 INFO L481 AbstractCegarLoop]: Abstraction has 1313 states and 1919 transitions. [2021-01-06 11:35:37,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1919 transitions. [2021-01-06 11:35:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 11:35:37,408 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:37,408 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] [2021-01-06 11:35:37,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:35:37,409 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:37,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:37,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1301716177, now seen corresponding path program 1 times [2021-01-06 11:35:37,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:37,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209476637] [2021-01-06 11:35:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:37,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209476637] [2021-01-06 11:35:37,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:37,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:37,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535127604] [2021-01-06 11:35:37,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:37,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:37,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:37,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:37,491 INFO L87 Difference]: Start difference. First operand 1313 states and 1919 transitions. Second operand 3 states. [2021-01-06 11:35:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:37,596 INFO L93 Difference]: Finished difference Result 3800 states and 5511 transitions. [2021-01-06 11:35:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:37,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2021-01-06 11:35:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:37,611 INFO L225 Difference]: With dead ends: 3800 [2021-01-06 11:35:37,611 INFO L226 Difference]: Without dead ends: 2497 [2021-01-06 11:35:37,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2021-01-06 11:35:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2495. [2021-01-06 11:35:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2021-01-06 11:35:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3572 transitions. [2021-01-06 11:35:37,763 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3572 transitions. Word has length 56 [2021-01-06 11:35:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:37,764 INFO L481 AbstractCegarLoop]: Abstraction has 2495 states and 3572 transitions. [2021-01-06 11:35:37,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3572 transitions. [2021-01-06 11:35:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 11:35:37,769 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:37,769 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] [2021-01-06 11:35:37,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:35:37,770 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:37,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1196163616, now seen corresponding path program 1 times [2021-01-06 11:35:37,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:37,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382959834] [2021-01-06 11:35:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:35:37,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:35:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:35:37,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:35:37,894 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:35:37,894 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:35:37,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:35:38,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:35:38 BoogieIcfgContainer [2021-01-06 11:35:38,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:35:38,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:35:38,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:35:38,009 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:35:38,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:31" (3/4) ... [2021-01-06 11:35:38,012 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 11:35:38,108 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_srvr_14.cil.c-witness.graphml [2021-01-06 11:35:38,108 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:35:38,112 INFO L168 Benchmark]: Toolchain (without parser) took 8393.83 ms. Allocated memory was 151.0 MB in the beginning and 231.7 MB in the end (delta: 80.7 MB). Free memory was 126.1 MB in the beginning and 155.4 MB in the end (delta: -29.2 MB). Peak memory consumption was 53.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:38,113 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 124.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:35:38,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.92 ms. Allocated memory is still 151.0 MB. Free memory was 125.9 MB in the beginning and 110.6 MB in the end (delta: 15.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:38,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.52 ms. Allocated memory is still 151.0 MB. Free memory was 110.4 MB in the beginning and 107.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:38,117 INFO L168 Benchmark]: Boogie Preprocessor took 100.20 ms. Allocated memory is still 151.0 MB. Free memory was 107.5 MB in the beginning and 105.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:38,118 INFO L168 Benchmark]: RCFGBuilder took 1441.45 ms. Allocated memory is still 151.0 MB. Free memory was 105.4 MB in the beginning and 82.6 MB in the end (delta: 22.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:38,118 INFO L168 Benchmark]: TraceAbstraction took 6208.53 ms. Allocated memory was 151.0 MB in the beginning and 231.7 MB in the end (delta: 80.7 MB). Free memory was 82.6 MB in the beginning and 163.8 MB in the end (delta: -81.2 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:35:38,119 INFO L168 Benchmark]: Witness Printer took 99.27 ms. Allocated memory is still 231.7 MB. Free memory was 163.8 MB in the beginning and 155.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:38,121 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.23 ms. Allocated memory is still 151.0 MB. Free memory is still 124.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 429.92 ms. Allocated memory is still 151.0 MB. Free memory was 125.9 MB in the beginning and 110.6 MB in the end (delta: 15.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 106.52 ms. Allocated memory is still 151.0 MB. Free memory was 110.4 MB in the beginning and 107.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 100.20 ms. Allocated memory is still 151.0 MB. Free memory was 107.5 MB in the beginning and 105.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1441.45 ms. Allocated memory is still 151.0 MB. Free memory was 105.4 MB in the beginning and 82.6 MB in the end (delta: 22.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6208.53 ms. Allocated memory was 151.0 MB in the beginning and 231.7 MB in the end (delta: 80.7 MB). Free memory was 82.6 MB in the beginning and 163.8 MB in the end (delta: -81.2 MB). There was no memory consumed. Max. memory is 8.0 GB. * Witness Printer took 99.27 ms. Allocated memory is still 231.7 MB. Free memory was 163.8 MB in the beginning and 155.4 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: 6.0s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 3.4s, 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.7s 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.7s 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...