/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_clnt_4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:35:05,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:35:05,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:35:06,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:35:06,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:35:06,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:35:06,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:35:06,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:35:06,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:35:06,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:35:06,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:35:06,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:35:06,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:35:06,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:35:06,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:35:06,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:35:06,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:35:06,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:35:06,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:35:06,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:35:06,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:35:06,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:35:06,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:35:06,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:35:06,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:35:06,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:35:06,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:35:06,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:35:06,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:35:06,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:35:06,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:35:06,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:35:06,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:35:06,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:35:06,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:35:06,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:35:06,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:35:06,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:35:06,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:35:06,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:35:06,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:35:06,086 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:06,139 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:35:06,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:35:06,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:35:06,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:35:06,143 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:35:06,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:35:06,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:35:06,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:35:06,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:35:06,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:35:06,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:35:06,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:35:06,147 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:35:06,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:35:06,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:35:06,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:35:06,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:35:06,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:35:06,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:35:06,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:35:06,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:35:06,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:35:06,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:35:06,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:35:06,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:35:06,152 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:06,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:35:06,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:35:06,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:35:06,681 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:35:06,682 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:35:06,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_clnt_4.cil-1.c [2021-01-06 11:35:06,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4e5e1b3f/3d3373364aa1497ab54f97d4d8225307/FLAGf9d72d5d6 [2021-01-06 11:35:07,409 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:35:07,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_4.cil-1.c [2021-01-06 11:35:07,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4e5e1b3f/3d3373364aa1497ab54f97d4d8225307/FLAGf9d72d5d6 [2021-01-06 11:35:07,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4e5e1b3f/3d3373364aa1497ab54f97d4d8225307 [2021-01-06 11:35:07,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:35:07,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:35:07,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:07,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:35:07,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:35:07,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:07" (1/1) ... [2021-01-06 11:35:07,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e4a001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:07, skipping insertion in model container [2021-01-06 11:35:07,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:07" (1/1) ... [2021-01-06 11:35:07,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:35:07,796 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~tmp___0~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__state~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[~ret~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[~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[~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[~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[~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[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~l~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__s3__change_cipher_spec~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[~s__s3__change_cipher_spec~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[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__compress_meth~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__compress_meth~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[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__flags~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__flags~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__delay_buf_pop_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__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp62~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[~__cil_tmp63~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[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp64~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp65~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:08,034 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_clnt_4.cil-1.c[35356,35369] left hand side expression in assignment: lhs: VariableLHS[~s~0,] [2021-01-06 11:35:08,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:08,055 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~tmp___0~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__state~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[~ret~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[~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[~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[~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[~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[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~l~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__s3__change_cipher_spec~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[~s__s3__change_cipher_spec~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[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__compress_meth~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__compress_meth~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[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__flags~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__flags~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__delay_buf_pop_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__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp62~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[~__cil_tmp63~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[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp64~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp65~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:08,118 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_clnt_4.cil-1.c[35356,35369] left hand side expression in assignment: lhs: VariableLHS[~s~0,] [2021-01-06 11:35:08,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:08,150 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:35:08,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:08 WrapperNode [2021-01-06 11:35:08,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:08,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:08,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:35:08,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:35:08,162 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:08" (1/1) ... [2021-01-06 11:35:08,175 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:08" (1/1) ... [2021-01-06 11:35:08,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:08,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:35:08,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:35:08,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:35:08,240 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:08" (1/1) ... [2021-01-06 11:35:08,240 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:08" (1/1) ... [2021-01-06 11:35:08,244 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:08" (1/1) ... [2021-01-06 11:35:08,245 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:08" (1/1) ... [2021-01-06 11:35:08,254 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:08" (1/1) ... [2021-01-06 11:35:08,263 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:08" (1/1) ... [2021-01-06 11:35:08,267 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:08" (1/1) ... [2021-01-06 11:35:08,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:35:08,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:35:08,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:35:08,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:35:08,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:08" (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:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:35:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:35:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:35:08,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:35:08,606 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:35:09,390 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-01-06 11:35:09,390 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-01-06 11:35:09,400 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:35:09,401 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:35:09,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:09 BoogieIcfgContainer [2021-01-06 11:35:09,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:35:09,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:35:09,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:35:09,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:35:09,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:35:07" (1/3) ... [2021-01-06 11:35:09,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd047e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:09, skipping insertion in model container [2021-01-06 11:35:09,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:08" (2/3) ... [2021-01-06 11:35:09,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd047e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:09, skipping insertion in model container [2021-01-06 11:35:09,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:09" (3/3) ... [2021-01-06 11:35:09,413 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2021-01-06 11:35:09,420 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:35:09,426 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:35:09,444 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:35:09,474 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:35:09,474 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:35:09,475 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:35:09,475 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:35:09,475 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:35:09,475 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:35:09,475 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:35:09,475 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:35:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2021-01-06 11:35:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 11:35:09,509 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:09,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] [2021-01-06 11:35:09,510 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:09,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695038, now seen corresponding path program 1 times [2021-01-06 11:35:09,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:09,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075701581] [2021-01-06 11:35:09,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:09,821 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:09,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075701581] [2021-01-06 11:35:09,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:09,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:09,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311545234] [2021-01-06 11:35:09,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:09,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:09,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:09,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:09,857 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2021-01-06 11:35:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:10,055 INFO L93 Difference]: Finished difference Result 252 states and 427 transitions. [2021-01-06 11:35:10,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:10,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-01-06 11:35:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:10,070 INFO L225 Difference]: With dead ends: 252 [2021-01-06 11:35:10,071 INFO L226 Difference]: Without dead ends: 115 [2021-01-06 11:35:10,075 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:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-01-06 11:35:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-01-06 11:35:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2021-01-06 11:35:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2021-01-06 11:35:10,128 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2021-01-06 11:35:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:10,129 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2021-01-06 11:35:10,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2021-01-06 11:35:10,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 11:35:10,131 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:10,132 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:10,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:35:10,132 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash 561717339, now seen corresponding path program 1 times [2021-01-06 11:35:10,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:10,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185016579] [2021-01-06 11:35:10,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:10,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185016579] [2021-01-06 11:35:10,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:10,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:10,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287263726] [2021-01-06 11:35:10,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:10,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:10,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:10,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:10,230 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2021-01-06 11:35:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:10,417 INFO L93 Difference]: Finished difference Result 238 states and 360 transitions. [2021-01-06 11:35:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:10,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2021-01-06 11:35:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:10,420 INFO L225 Difference]: With dead ends: 238 [2021-01-06 11:35:10,420 INFO L226 Difference]: Without dead ends: 133 [2021-01-06 11:35:10,422 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:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-01-06 11:35:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2021-01-06 11:35:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2021-01-06 11:35:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2021-01-06 11:35:10,436 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 37 [2021-01-06 11:35:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:10,436 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2021-01-06 11:35:10,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2021-01-06 11:35:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:35:10,439 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:10,439 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:10,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:35:10,440 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash 356453796, now seen corresponding path program 1 times [2021-01-06 11:35:10,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:10,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286365068] [2021-01-06 11:35:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:35:10,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286365068] [2021-01-06 11:35:10,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:10,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:10,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543082721] [2021-01-06 11:35:10,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:10,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:10,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:10,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:10,524 INFO L87 Difference]: Start difference. First operand 130 states and 192 transitions. Second operand 3 states. [2021-01-06 11:35:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:10,668 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2021-01-06 11:35:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:10,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2021-01-06 11:35:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:10,671 INFO L225 Difference]: With dead ends: 271 [2021-01-06 11:35:10,671 INFO L226 Difference]: Without dead ends: 151 [2021-01-06 11:35:10,672 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:10,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-01-06 11:35:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2021-01-06 11:35:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2021-01-06 11:35:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2021-01-06 11:35:10,683 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 51 [2021-01-06 11:35:10,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:10,684 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2021-01-06 11:35:10,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2021-01-06 11:35:10,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 11:35:10,686 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:10,687 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:10,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:35:10,687 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:10,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1231505257, now seen corresponding path program 1 times [2021-01-06 11:35:10,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:10,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52636724] [2021-01-06 11:35:10,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 11:35:10,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52636724] [2021-01-06 11:35:10,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:10,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:10,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45382823] [2021-01-06 11:35:10,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:10,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:10,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:10,798 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand 3 states. [2021-01-06 11:35:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:10,981 INFO L93 Difference]: Finished difference Result 335 states and 503 transitions. [2021-01-06 11:35:10,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:10,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-01-06 11:35:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:10,986 INFO L225 Difference]: With dead ends: 335 [2021-01-06 11:35:10,987 INFO L226 Difference]: Without dead ends: 197 [2021-01-06 11:35:10,990 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:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-01-06 11:35:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2021-01-06 11:35:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2021-01-06 11:35:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2021-01-06 11:35:11,020 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 68 [2021-01-06 11:35:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:11,022 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2021-01-06 11:35:11,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2021-01-06 11:35:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 11:35:11,031 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:11,032 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:11,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:35:11,032 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:11,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:11,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1258023705, now seen corresponding path program 1 times [2021-01-06 11:35:11,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:11,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948491859] [2021-01-06 11:35:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 11:35:11,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948491859] [2021-01-06 11:35:11,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:11,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:11,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503931117] [2021-01-06 11:35:11,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:11,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:11,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:11,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:11,123 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand 3 states. [2021-01-06 11:35:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:11,263 INFO L93 Difference]: Finished difference Result 391 states and 557 transitions. [2021-01-06 11:35:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:11,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-01-06 11:35:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:11,268 INFO L225 Difference]: With dead ends: 391 [2021-01-06 11:35:11,268 INFO L226 Difference]: Without dead ends: 213 [2021-01-06 11:35:11,270 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:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-01-06 11:35:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2021-01-06 11:35:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2021-01-06 11:35:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2021-01-06 11:35:11,284 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 68 [2021-01-06 11:35:11,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:11,287 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2021-01-06 11:35:11,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2021-01-06 11:35:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:35:11,294 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:11,295 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:11,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:35:11,295 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:11,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:11,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1378844437, now seen corresponding path program 1 times [2021-01-06 11:35:11,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:11,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746428403] [2021-01-06 11:35:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-01-06 11:35:11,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746428403] [2021-01-06 11:35:11,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:11,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:11,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208723057] [2021-01-06 11:35:11,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:11,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:11,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:11,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:11,382 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand 3 states. [2021-01-06 11:35:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:11,502 INFO L93 Difference]: Finished difference Result 428 states and 604 transitions. [2021-01-06 11:35:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:11,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:35:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:11,506 INFO L225 Difference]: With dead ends: 428 [2021-01-06 11:35:11,506 INFO L226 Difference]: Without dead ends: 231 [2021-01-06 11:35:11,507 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:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-01-06 11:35:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2021-01-06 11:35:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2021-01-06 11:35:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 314 transitions. [2021-01-06 11:35:11,518 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 314 transitions. Word has length 85 [2021-01-06 11:35:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:11,519 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 314 transitions. [2021-01-06 11:35:11,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 314 transitions. [2021-01-06 11:35:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 11:35:11,521 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:11,521 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:11,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:35:11,525 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:11,527 INFO L82 PathProgramCache]: Analyzing trace with hash 311084899, now seen corresponding path program 1 times [2021-01-06 11:35:11,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:11,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984453036] [2021-01-06 11:35:11,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-06 11:35:11,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984453036] [2021-01-06 11:35:11,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:11,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:11,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006650484] [2021-01-06 11:35:11,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:11,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:11,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:11,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:11,664 INFO L87 Difference]: Start difference. First operand 228 states and 314 transitions. Second operand 3 states. [2021-01-06 11:35:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:11,704 INFO L93 Difference]: Finished difference Result 660 states and 910 transitions. [2021-01-06 11:35:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:11,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 11:35:11,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:11,710 INFO L225 Difference]: With dead ends: 660 [2021-01-06 11:35:11,710 INFO L226 Difference]: Without dead ends: 442 [2021-01-06 11:35:11,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-01-06 11:35:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2021-01-06 11:35:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2021-01-06 11:35:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 605 transitions. [2021-01-06 11:35:11,730 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 605 transitions. Word has length 105 [2021-01-06 11:35:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:11,731 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 605 transitions. [2021-01-06 11:35:11,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 605 transitions. [2021-01-06 11:35:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 11:35:11,738 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:11,739 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:11,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:35:11,740 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:11,740 INFO L82 PathProgramCache]: Analyzing trace with hash 990357153, now seen corresponding path program 1 times [2021-01-06 11:35:11,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:11,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89762208] [2021-01-06 11:35:11,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 11:35:11,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89762208] [2021-01-06 11:35:11,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:11,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:11,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452431184] [2021-01-06 11:35:11,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:11,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:11,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:11,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:11,854 INFO L87 Difference]: Start difference. First operand 442 states and 605 transitions. Second operand 3 states. [2021-01-06 11:35:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:11,883 INFO L93 Difference]: Finished difference Result 895 states and 1224 transitions. [2021-01-06 11:35:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:11,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 11:35:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:11,887 INFO L225 Difference]: With dead ends: 895 [2021-01-06 11:35:11,887 INFO L226 Difference]: Without dead ends: 463 [2021-01-06 11:35:11,888 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:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-01-06 11:35:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2021-01-06 11:35:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2021-01-06 11:35:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 632 transitions. [2021-01-06 11:35:11,902 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 632 transitions. Word has length 105 [2021-01-06 11:35:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:11,902 INFO L481 AbstractCegarLoop]: Abstraction has 463 states and 632 transitions. [2021-01-06 11:35:11,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 632 transitions. [2021-01-06 11:35:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 11:35:11,904 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:11,905 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:11,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:35:11,905 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:11,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1829390815, now seen corresponding path program 1 times [2021-01-06 11:35:11,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:11,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453730239] [2021-01-06 11:35:11,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-01-06 11:35:11,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453730239] [2021-01-06 11:35:11,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:11,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:11,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384798285] [2021-01-06 11:35:11,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:11,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:11,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:11,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:11,960 INFO L87 Difference]: Start difference. First operand 463 states and 632 transitions. Second operand 3 states. [2021-01-06 11:35:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:11,992 INFO L93 Difference]: Finished difference Result 943 states and 1285 transitions. [2021-01-06 11:35:11,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:11,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 11:35:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:11,996 INFO L225 Difference]: With dead ends: 943 [2021-01-06 11:35:11,996 INFO L226 Difference]: Without dead ends: 490 [2021-01-06 11:35:11,997 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:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-01-06 11:35:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2021-01-06 11:35:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2021-01-06 11:35:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 666 transitions. [2021-01-06 11:35:12,012 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 666 transitions. Word has length 105 [2021-01-06 11:35:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:12,012 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 666 transitions. [2021-01-06 11:35:12,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 666 transitions. [2021-01-06 11:35:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 11:35:12,014 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:12,014 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:12,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:35:12,015 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:12,015 INFO L82 PathProgramCache]: Analyzing trace with hash -915547054, now seen corresponding path program 1 times [2021-01-06 11:35:12,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:12,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14067426] [2021-01-06 11:35:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-01-06 11:35:12,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14067426] [2021-01-06 11:35:12,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:12,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:12,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697571260] [2021-01-06 11:35:12,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:12,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:12,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:12,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:12,078 INFO L87 Difference]: Start difference. First operand 490 states and 666 transitions. Second operand 3 states. [2021-01-06 11:35:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:12,129 INFO L93 Difference]: Finished difference Result 708 states and 966 transitions. [2021-01-06 11:35:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:12,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-06 11:35:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:12,134 INFO L225 Difference]: With dead ends: 708 [2021-01-06 11:35:12,134 INFO L226 Difference]: Without dead ends: 706 [2021-01-06 11:35:12,134 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:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2021-01-06 11:35:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2021-01-06 11:35:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2021-01-06 11:35:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 964 transitions. [2021-01-06 11:35:12,154 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 964 transitions. Word has length 107 [2021-01-06 11:35:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:12,154 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 964 transitions. [2021-01-06 11:35:12,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 964 transitions. [2021-01-06 11:35:12,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 11:35:12,157 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:12,157 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:12,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:35:12,158 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:12,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:12,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1430305885, now seen corresponding path program 1 times [2021-01-06 11:35:12,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:12,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250026907] [2021-01-06 11:35:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-01-06 11:35:12,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250026907] [2021-01-06 11:35:12,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:12,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:12,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850219326] [2021-01-06 11:35:12,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:12,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:12,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:12,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:12,252 INFO L87 Difference]: Start difference. First operand 706 states and 964 transitions. Second operand 3 states. [2021-01-06 11:35:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:12,440 INFO L93 Difference]: Finished difference Result 1528 states and 2147 transitions. [2021-01-06 11:35:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:12,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2021-01-06 11:35:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:12,445 INFO L225 Difference]: With dead ends: 1528 [2021-01-06 11:35:12,446 INFO L226 Difference]: Without dead ends: 856 [2021-01-06 11:35:12,447 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:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2021-01-06 11:35:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2021-01-06 11:35:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2021-01-06 11:35:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1153 transitions. [2021-01-06 11:35:12,470 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1153 transitions. Word has length 147 [2021-01-06 11:35:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:12,470 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 1153 transitions. [2021-01-06 11:35:12,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1153 transitions. [2021-01-06 11:35:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-01-06 11:35:12,473 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:12,474 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:12,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:35:12,474 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:12,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1346631412, now seen corresponding path program 1 times [2021-01-06 11:35:12,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:12,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069153844] [2021-01-06 11:35:12,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-01-06 11:35:12,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069153844] [2021-01-06 11:35:12,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:12,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:12,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832187082] [2021-01-06 11:35:12,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:12,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:12,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:12,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:12,564 INFO L87 Difference]: Start difference. First operand 823 states and 1153 transitions. Second operand 3 states. [2021-01-06 11:35:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:12,775 INFO L93 Difference]: Finished difference Result 1689 states and 2365 transitions. [2021-01-06 11:35:12,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:12,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2021-01-06 11:35:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:12,783 INFO L225 Difference]: With dead ends: 1689 [2021-01-06 11:35:12,783 INFO L226 Difference]: Without dead ends: 903 [2021-01-06 11:35:12,785 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:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2021-01-06 11:35:12,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 892. [2021-01-06 11:35:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2021-01-06 11:35:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1237 transitions. [2021-01-06 11:35:12,827 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1237 transitions. Word has length 183 [2021-01-06 11:35:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:12,828 INFO L481 AbstractCegarLoop]: Abstraction has 892 states and 1237 transitions. [2021-01-06 11:35:12,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1237 transitions. [2021-01-06 11:35:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-01-06 11:35:12,835 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:12,836 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:12,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:35:12,837 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:12,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:12,838 INFO L82 PathProgramCache]: Analyzing trace with hash 880338370, now seen corresponding path program 1 times [2021-01-06 11:35:12,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:12,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115804846] [2021-01-06 11:35:12,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2021-01-06 11:35:13,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115804846] [2021-01-06 11:35:13,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:13,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:13,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091498378] [2021-01-06 11:35:13,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:13,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:13,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:13,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:13,014 INFO L87 Difference]: Start difference. First operand 892 states and 1237 transitions. Second operand 3 states. [2021-01-06 11:35:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:13,191 INFO L93 Difference]: Finished difference Result 1831 states and 2546 transitions. [2021-01-06 11:35:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:13,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2021-01-06 11:35:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:13,197 INFO L225 Difference]: With dead ends: 1831 [2021-01-06 11:35:13,197 INFO L226 Difference]: Without dead ends: 976 [2021-01-06 11:35:13,199 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:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2021-01-06 11:35:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 967. [2021-01-06 11:35:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2021-01-06 11:35:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1327 transitions. [2021-01-06 11:35:13,223 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1327 transitions. Word has length 204 [2021-01-06 11:35:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:13,224 INFO L481 AbstractCegarLoop]: Abstraction has 967 states and 1327 transitions. [2021-01-06 11:35:13,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:13,224 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1327 transitions. [2021-01-06 11:35:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2021-01-06 11:35:13,227 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:13,228 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:13,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:35:13,228 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:13,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1998340689, now seen corresponding path program 1 times [2021-01-06 11:35:13,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:13,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834106493] [2021-01-06 11:35:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2021-01-06 11:35:13,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834106493] [2021-01-06 11:35:13,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:13,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:13,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25373406] [2021-01-06 11:35:13,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:13,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:13,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:13,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:13,366 INFO L87 Difference]: Start difference. First operand 967 states and 1327 transitions. Second operand 3 states. [2021-01-06 11:35:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:13,530 INFO L93 Difference]: Finished difference Result 1987 states and 2735 transitions. [2021-01-06 11:35:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:13,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2021-01-06 11:35:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:13,536 INFO L225 Difference]: With dead ends: 1987 [2021-01-06 11:35:13,537 INFO L226 Difference]: Without dead ends: 1057 [2021-01-06 11:35:13,538 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:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-01-06 11:35:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1051. [2021-01-06 11:35:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2021-01-06 11:35:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1426 transitions. [2021-01-06 11:35:13,567 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1426 transitions. Word has length 228 [2021-01-06 11:35:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:13,567 INFO L481 AbstractCegarLoop]: Abstraction has 1051 states and 1426 transitions. [2021-01-06 11:35:13,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1426 transitions. [2021-01-06 11:35:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2021-01-06 11:35:13,572 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:13,572 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:13,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:35:13,573 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:13,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:13,573 INFO L82 PathProgramCache]: Analyzing trace with hash -967299791, now seen corresponding path program 1 times [2021-01-06 11:35:13,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:13,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389113154] [2021-01-06 11:35:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2021-01-06 11:35:13,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389113154] [2021-01-06 11:35:13,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:13,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:13,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098578563] [2021-01-06 11:35:13,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:13,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:13,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:13,717 INFO L87 Difference]: Start difference. First operand 1051 states and 1426 transitions. Second operand 3 states. [2021-01-06 11:35:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:13,887 INFO L93 Difference]: Finished difference Result 2167 states and 2960 transitions. [2021-01-06 11:35:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:13,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2021-01-06 11:35:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:13,894 INFO L225 Difference]: With dead ends: 2167 [2021-01-06 11:35:13,894 INFO L226 Difference]: Without dead ends: 1153 [2021-01-06 11:35:13,899 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:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-01-06 11:35:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1144. [2021-01-06 11:35:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2021-01-06 11:35:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1534 transitions. [2021-01-06 11:35:13,929 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1534 transitions. Word has length 228 [2021-01-06 11:35:13,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:13,929 INFO L481 AbstractCegarLoop]: Abstraction has 1144 states and 1534 transitions. [2021-01-06 11:35:13,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1534 transitions. [2021-01-06 11:35:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-01-06 11:35:13,934 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:13,935 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:35:13,936 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:13,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:13,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1465419185, now seen corresponding path program 1 times [2021-01-06 11:35:13,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:13,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839598290] [2021-01-06 11:35:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-01-06 11:35:14,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839598290] [2021-01-06 11:35:14,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:14,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:14,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025070381] [2021-01-06 11:35:14,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:14,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:14,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:14,092 INFO L87 Difference]: Start difference. First operand 1144 states and 1534 transitions. Second operand 3 states. [2021-01-06 11:35:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:14,137 INFO L93 Difference]: Finished difference Result 3355 states and 4503 transitions. [2021-01-06 11:35:14,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:14,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2021-01-06 11:35:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:14,150 INFO L225 Difference]: With dead ends: 3355 [2021-01-06 11:35:14,150 INFO L226 Difference]: Without dead ends: 2248 [2021-01-06 11:35:14,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2021-01-06 11:35:14,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2246. [2021-01-06 11:35:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2021-01-06 11:35:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3013 transitions. [2021-01-06 11:35:14,222 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3013 transitions. Word has length 258 [2021-01-06 11:35:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:14,223 INFO L481 AbstractCegarLoop]: Abstraction has 2246 states and 3013 transitions. [2021-01-06 11:35:14,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3013 transitions. [2021-01-06 11:35:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-01-06 11:35:14,230 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:14,230 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:35:14,231 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash -434378287, now seen corresponding path program 1 times [2021-01-06 11:35:14,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:14,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869533434] [2021-01-06 11:35:14,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2021-01-06 11:35:14,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869533434] [2021-01-06 11:35:14,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:14,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:14,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490964671] [2021-01-06 11:35:14,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:14,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:14,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:14,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:14,387 INFO L87 Difference]: Start difference. First operand 2246 states and 3013 transitions. Second operand 3 states. [2021-01-06 11:35:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:14,599 INFO L93 Difference]: Finished difference Result 4680 states and 6329 transitions. [2021-01-06 11:35:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:14,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2021-01-06 11:35:14,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:14,613 INFO L225 Difference]: With dead ends: 4680 [2021-01-06 11:35:14,613 INFO L226 Difference]: Without dead ends: 2471 [2021-01-06 11:35:14,617 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:14,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2021-01-06 11:35:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2459. [2021-01-06 11:35:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2021-01-06 11:35:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3256 transitions. [2021-01-06 11:35:14,703 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3256 transitions. Word has length 258 [2021-01-06 11:35:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:14,704 INFO L481 AbstractCegarLoop]: Abstraction has 2459 states and 3256 transitions. [2021-01-06 11:35:14,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3256 transitions. [2021-01-06 11:35:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-01-06 11:35:14,713 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:14,713 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:14,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:35:14,714 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1948571271, now seen corresponding path program 1 times [2021-01-06 11:35:14,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:14,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96116438] [2021-01-06 11:35:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2021-01-06 11:35:14,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96116438] [2021-01-06 11:35:14,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:14,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:14,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076619699] [2021-01-06 11:35:14,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:14,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:14,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:14,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:14,906 INFO L87 Difference]: Start difference. First operand 2459 states and 3256 transitions. Second operand 3 states. [2021-01-06 11:35:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:15,099 INFO L93 Difference]: Finished difference Result 4992 states and 6632 transitions. [2021-01-06 11:35:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:15,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2021-01-06 11:35:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:15,112 INFO L225 Difference]: With dead ends: 4992 [2021-01-06 11:35:15,112 INFO L226 Difference]: Without dead ends: 2570 [2021-01-06 11:35:15,118 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:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2021-01-06 11:35:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2558. [2021-01-06 11:35:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2021-01-06 11:35:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3370 transitions. [2021-01-06 11:35:15,208 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3370 transitions. Word has length 282 [2021-01-06 11:35:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:15,209 INFO L481 AbstractCegarLoop]: Abstraction has 2558 states and 3370 transitions. [2021-01-06 11:35:15,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3370 transitions. [2021-01-06 11:35:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2021-01-06 11:35:15,217 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:15,218 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:15,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:35:15,218 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:15,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1124753462, now seen corresponding path program 1 times [2021-01-06 11:35:15,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:15,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476607843] [2021-01-06 11:35:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2021-01-06 11:35:15,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476607843] [2021-01-06 11:35:15,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:15,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:15,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663330499] [2021-01-06 11:35:15,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:15,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:15,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:15,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:15,413 INFO L87 Difference]: Start difference. First operand 2558 states and 3370 transitions. Second operand 3 states. [2021-01-06 11:35:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:15,639 INFO L93 Difference]: Finished difference Result 5379 states and 7220 transitions. [2021-01-06 11:35:15,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:15,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2021-01-06 11:35:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:15,655 INFO L225 Difference]: With dead ends: 5379 [2021-01-06 11:35:15,655 INFO L226 Difference]: Without dead ends: 2858 [2021-01-06 11:35:15,659 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:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2021-01-06 11:35:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2798. [2021-01-06 11:35:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2798 states. [2021-01-06 11:35:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3652 transitions. [2021-01-06 11:35:15,751 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3652 transitions. Word has length 293 [2021-01-06 11:35:15,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:15,751 INFO L481 AbstractCegarLoop]: Abstraction has 2798 states and 3652 transitions. [2021-01-06 11:35:15,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3652 transitions. [2021-01-06 11:35:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2021-01-06 11:35:15,763 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:15,763 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:35:15,764 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:15,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:15,764 INFO L82 PathProgramCache]: Analyzing trace with hash 495610836, now seen corresponding path program 1 times [2021-01-06 11:35:15,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:15,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054054446] [2021-01-06 11:35:15,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2021-01-06 11:35:15,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054054446] [2021-01-06 11:35:15,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:15,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:15,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761419230] [2021-01-06 11:35:15,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:15,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:15,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:15,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:15,909 INFO L87 Difference]: Start difference. First operand 2798 states and 3652 transitions. Second operand 3 states. [2021-01-06 11:35:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:16,134 INFO L93 Difference]: Finished difference Result 5643 states and 7358 transitions. [2021-01-06 11:35:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:16,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2021-01-06 11:35:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:16,148 INFO L225 Difference]: With dead ends: 5643 [2021-01-06 11:35:16,148 INFO L226 Difference]: Without dead ends: 2864 [2021-01-06 11:35:16,153 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:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2021-01-06 11:35:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2792. [2021-01-06 11:35:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2792 states. [2021-01-06 11:35:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 3616 transitions. [2021-01-06 11:35:16,265 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 3616 transitions. Word has length 301 [2021-01-06 11:35:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:16,266 INFO L481 AbstractCegarLoop]: Abstraction has 2792 states and 3616 transitions. [2021-01-06 11:35:16,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3616 transitions. [2021-01-06 11:35:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2021-01-06 11:35:16,274 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:16,274 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:16,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:35:16,275 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:16,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:16,276 INFO L82 PathProgramCache]: Analyzing trace with hash -870156213, now seen corresponding path program 1 times [2021-01-06 11:35:16,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:16,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086988284] [2021-01-06 11:35:16,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2021-01-06 11:35:16,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086988284] [2021-01-06 11:35:16,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994892720] [2021-01-06 11:35:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:35:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:16,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:35:16,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:35:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2021-01-06 11:35:17,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:35:17,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:35:17,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034430258] [2021-01-06 11:35:17,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:35:17,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:17,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:35:17,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:35:17,258 INFO L87 Difference]: Start difference. First operand 2792 states and 3616 transitions. Second operand 4 states. [2021-01-06 11:35:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:17,735 INFO L93 Difference]: Finished difference Result 8410 states and 10878 transitions. [2021-01-06 11:35:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:35:17,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2021-01-06 11:35:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:17,763 INFO L225 Difference]: With dead ends: 8410 [2021-01-06 11:35:17,764 INFO L226 Difference]: Without dead ends: 5649 [2021-01-06 11:35:17,769 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 334 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:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2021-01-06 11:35:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 3680. [2021-01-06 11:35:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2021-01-06 11:35:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 4716 transitions. [2021-01-06 11:35:17,893 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 4716 transitions. Word has length 332 [2021-01-06 11:35:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:17,894 INFO L481 AbstractCegarLoop]: Abstraction has 3680 states and 4716 transitions. [2021-01-06 11:35:17,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:35:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 4716 transitions. [2021-01-06 11:35:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2021-01-06 11:35:17,923 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:17,924 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:18,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-06 11:35:18,138 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:18,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:18,139 INFO L82 PathProgramCache]: Analyzing trace with hash -734234391, now seen corresponding path program 1 times [2021-01-06 11:35:18,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:18,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727328993] [2021-01-06 11:35:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 770 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2021-01-06 11:35:18,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727328993] [2021-01-06 11:35:18,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:18,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:18,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028436995] [2021-01-06 11:35:18,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:18,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:18,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:18,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:18,386 INFO L87 Difference]: Start difference. First operand 3680 states and 4716 transitions. Second operand 3 states. [2021-01-06 11:35:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:18,490 INFO L93 Difference]: Finished difference Result 9682 states and 12466 transitions. [2021-01-06 11:35:18,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:18,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2021-01-06 11:35:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:18,530 INFO L225 Difference]: With dead ends: 9682 [2021-01-06 11:35:18,531 INFO L226 Difference]: Without dead ends: 6039 [2021-01-06 11:35:18,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2021-01-06 11:35:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 5695. [2021-01-06 11:35:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5695 states. [2021-01-06 11:35:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 7327 transitions. [2021-01-06 11:35:18,725 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 7327 transitions. Word has length 333 [2021-01-06 11:35:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:18,726 INFO L481 AbstractCegarLoop]: Abstraction has 5695 states and 7327 transitions. [2021-01-06 11:35:18,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 7327 transitions. [2021-01-06 11:35:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2021-01-06 11:35:18,735 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:18,735 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:18,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:35:18,735 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:18,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1600541490, now seen corresponding path program 1 times [2021-01-06 11:35:18,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:18,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810552287] [2021-01-06 11:35:18,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-01-06 11:35:18,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810552287] [2021-01-06 11:35:18,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:18,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:18,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146825186] [2021-01-06 11:35:18,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:18,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:18,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:18,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:18,879 INFO L87 Difference]: Start difference. First operand 5695 states and 7327 transitions. Second operand 3 states. [2021-01-06 11:35:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:19,145 INFO L93 Difference]: Finished difference Result 11959 states and 15320 transitions. [2021-01-06 11:35:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:19,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2021-01-06 11:35:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:19,162 INFO L225 Difference]: With dead ends: 11959 [2021-01-06 11:35:19,163 INFO L226 Difference]: Without dead ends: 6301 [2021-01-06 11:35:19,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6301 states. [2021-01-06 11:35:19,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6301 to 5869. [2021-01-06 11:35:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5869 states. [2021-01-06 11:35:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5869 states to 5869 states and 7561 transitions. [2021-01-06 11:35:19,388 INFO L78 Accepts]: Start accepts. Automaton has 5869 states and 7561 transitions. Word has length 338 [2021-01-06 11:35:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:19,388 INFO L481 AbstractCegarLoop]: Abstraction has 5869 states and 7561 transitions. [2021-01-06 11:35:19,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5869 states and 7561 transitions. [2021-01-06 11:35:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2021-01-06 11:35:19,399 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:19,399 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:19,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:35:19,400 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash 296800678, now seen corresponding path program 1 times [2021-01-06 11:35:19,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:19,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703476793] [2021-01-06 11:35:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-01-06 11:35:19,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703476793] [2021-01-06 11:35:19,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785633309] [2021-01-06 11:35:19,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:35:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:19,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:35:19,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:35:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-01-06 11:35:20,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:35:20,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:35:20,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821703523] [2021-01-06 11:35:20,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:35:20,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:20,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:35:20,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:35:20,296 INFO L87 Difference]: Start difference. First operand 5869 states and 7561 transitions. Second operand 4 states. [2021-01-06 11:35:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:20,708 INFO L93 Difference]: Finished difference Result 13204 states and 16946 transitions. [2021-01-06 11:35:20,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:35:20,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2021-01-06 11:35:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:20,726 INFO L225 Difference]: With dead ends: 13204 [2021-01-06 11:35:20,726 INFO L226 Difference]: Without dead ends: 7359 [2021-01-06 11:35:20,733 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 378 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:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7359 states. [2021-01-06 11:35:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7359 to 5989. [2021-01-06 11:35:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5989 states. [2021-01-06 11:35:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5989 states to 5989 states and 7642 transitions. [2021-01-06 11:35:20,902 INFO L78 Accepts]: Start accepts. Automaton has 5989 states and 7642 transitions. Word has length 376 [2021-01-06 11:35:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:20,903 INFO L481 AbstractCegarLoop]: Abstraction has 5989 states and 7642 transitions. [2021-01-06 11:35:20,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:35:20,903 INFO L276 IsEmpty]: Start isEmpty. Operand 5989 states and 7642 transitions. [2021-01-06 11:35:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2021-01-06 11:35:20,913 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:20,913 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:21,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-01-06 11:35:21,127 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:21,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2142183135, now seen corresponding path program 1 times [2021-01-06 11:35:21,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:21,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444631763] [2021-01-06 11:35:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2021-01-06 11:35:21,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444631763] [2021-01-06 11:35:21,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:21,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:21,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066234166] [2021-01-06 11:35:21,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:21,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:21,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:21,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:21,364 INFO L87 Difference]: Start difference. First operand 5989 states and 7642 transitions. Second operand 3 states. [2021-01-06 11:35:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:21,591 INFO L93 Difference]: Finished difference Result 11539 states and 14488 transitions. [2021-01-06 11:35:21,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:21,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 415 [2021-01-06 11:35:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:21,600 INFO L225 Difference]: With dead ends: 11539 [2021-01-06 11:35:21,600 INFO L226 Difference]: Without dead ends: 3293 [2021-01-06 11:35:21,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2021-01-06 11:35:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3227. [2021-01-06 11:35:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3227 states. [2021-01-06 11:35:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4073 transitions. [2021-01-06 11:35:21,684 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4073 transitions. Word has length 415 [2021-01-06 11:35:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:21,685 INFO L481 AbstractCegarLoop]: Abstraction has 3227 states and 4073 transitions. [2021-01-06 11:35:21,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4073 transitions. [2021-01-06 11:35:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2021-01-06 11:35:21,691 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:21,692 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:21,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:35:21,692 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:21,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2025530628, now seen corresponding path program 1 times [2021-01-06 11:35:21,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:21,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775759815] [2021-01-06 11:35:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2021-01-06 11:35:21,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775759815] [2021-01-06 11:35:21,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796896796] [2021-01-06 11:35:21,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:35:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:22,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:35:22,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:35:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2021-01-06 11:35:22,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:35:22,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:35:22,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622419287] [2021-01-06 11:35:22,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:35:22,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:22,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:35:22,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:35:22,623 INFO L87 Difference]: Start difference. First operand 3227 states and 4073 transitions. Second operand 4 states. [2021-01-06 11:35:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:22,917 INFO L93 Difference]: Finished difference Result 3861 states and 4882 transitions. [2021-01-06 11:35:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:35:22,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 482 [2021-01-06 11:35:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:22,919 INFO L225 Difference]: With dead ends: 3861 [2021-01-06 11:35:22,919 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 11:35:22,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 484 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:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 11:35:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 11:35:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 11:35:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 11:35:22,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 482 [2021-01-06 11:35:22,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:22,928 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 11:35:22,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:35:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 11:35:22,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 11:35:23,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-06 11:35:23,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 11:35:23,666 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 76 [2021-01-06 11:35:23,927 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 17 [2021-01-06 11:35:24,215 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 17 [2021-01-06 11:35:24,637 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2021-01-06 11:35:24,875 INFO L189 CegarLoopUtils]: For program point L531(lines 531 535) no Hoare annotation was computed. [2021-01-06 11:35:24,876 INFO L189 CegarLoopUtils]: For program point L267(lines 267 269) no Hoare annotation was computed. [2021-01-06 11:35:24,876 INFO L189 CegarLoopUtils]: For program point L267-2(lines 203 486) no Hoare annotation was computed. [2021-01-06 11:35:24,876 INFO L189 CegarLoopUtils]: For program point L433(lines 433 435) no Hoare annotation was computed. [2021-01-06 11:35:24,876 INFO L189 CegarLoopUtils]: For program point L334(lines 334 336) no Hoare annotation was computed. [2021-01-06 11:35:24,876 INFO L192 CegarLoopUtils]: At program point L202(lines 201 489) the Hoare annotation is: true [2021-01-06 11:35:24,876 INFO L189 CegarLoopUtils]: For program point L169(lines 169 499) no Hoare annotation was computed. [2021-01-06 11:35:24,877 INFO L189 CegarLoopUtils]: For program point L136(lines 136 510) no Hoare annotation was computed. [2021-01-06 11:35:24,877 INFO L189 CegarLoopUtils]: For program point L103(lines 103 521) no Hoare annotation was computed. [2021-01-06 11:35:24,877 INFO L185 CegarLoopUtils]: At program point L170(lines 166 500) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2021-01-06 11:35:24,877 INFO L185 CegarLoopUtils]: At program point L104(lines 103 521) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2021-01-06 11:35:24,877 INFO L189 CegarLoopUtils]: For program point L468(lines 468 470) no Hoare annotation was computed. [2021-01-06 11:35:24,877 INFO L189 CegarLoopUtils]: For program point L468-2(lines 468 470) no Hoare annotation was computed. [2021-01-06 11:35:24,877 INFO L189 CegarLoopUtils]: For program point L436(lines 436 440) no Hoare annotation was computed. [2021-01-06 11:35:24,878 INFO L189 CegarLoopUtils]: For program point L436-2(lines 436 440) no Hoare annotation was computed. [2021-01-06 11:35:24,878 INFO L189 CegarLoopUtils]: For program point L337(lines 337 341) no Hoare annotation was computed. [2021-01-06 11:35:24,879 INFO L189 CegarLoopUtils]: For program point L337-2(lines 337 341) no Hoare annotation was computed. [2021-01-06 11:35:24,879 INFO L189 CegarLoopUtils]: For program point L172(lines 172 498) no Hoare annotation was computed. [2021-01-06 11:35:24,879 INFO L189 CegarLoopUtils]: For program point L139(lines 139 509) no Hoare annotation was computed. [2021-01-06 11:35:24,879 INFO L189 CegarLoopUtils]: For program point L106(lines 106 520) no Hoare annotation was computed. [2021-01-06 11:35:24,880 INFO L185 CegarLoopUtils]: At program point L140(lines 136 510) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) [2021-01-06 11:35:24,881 INFO L189 CegarLoopUtils]: For program point L306(lines 306 308) no Hoare annotation was computed. [2021-01-06 11:35:24,882 INFO L189 CegarLoopUtils]: For program point L273(lines 273 277) no Hoare annotation was computed. [2021-01-06 11:35:24,882 INFO L189 CegarLoopUtils]: For program point L240(lines 240 243) no Hoare annotation was computed. [2021-01-06 11:35:24,882 INFO L189 CegarLoopUtils]: For program point L306-2(lines 203 486) no Hoare annotation was computed. [2021-01-06 11:35:24,882 INFO L189 CegarLoopUtils]: For program point L273-2(lines 273 277) no Hoare annotation was computed. [2021-01-06 11:35:24,882 INFO L189 CegarLoopUtils]: For program point L406(lines 406 408) no Hoare annotation was computed. [2021-01-06 11:35:24,882 INFO L189 CegarLoopUtils]: For program point L373(lines 373 375) no Hoare annotation was computed. [2021-01-06 11:35:24,882 INFO L185 CegarLoopUtils]: At program point L208(lines 106 520) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0)) [2021-01-06 11:35:24,883 INFO L189 CegarLoopUtils]: For program point L175(lines 175 497) no Hoare annotation was computed. [2021-01-06 11:35:24,883 INFO L189 CegarLoopUtils]: For program point L142(lines 142 508) no Hoare annotation was computed. [2021-01-06 11:35:24,883 INFO L189 CegarLoopUtils]: For program point L109(lines 109 519) no Hoare annotation was computed. [2021-01-06 11:35:24,884 INFO L185 CegarLoopUtils]: At program point L176(lines 172 498) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2021-01-06 11:35:24,884 INFO L189 CegarLoopUtils]: For program point L474(lines 474 476) no Hoare annotation was computed. [2021-01-06 11:35:24,884 INFO L189 CegarLoopUtils]: For program point L474-2(lines 474 476) no Hoare annotation was computed. [2021-01-06 11:35:24,884 INFO L192 CegarLoopUtils]: At program point L541(lines 99 542) the Hoare annotation is: true [2021-01-06 11:35:24,884 INFO L189 CegarLoopUtils]: For program point L178(lines 178 496) no Hoare annotation was computed. [2021-01-06 11:35:24,884 INFO L189 CegarLoopUtils]: For program point L145(lines 145 507) no Hoare annotation was computed. [2021-01-06 11:35:24,885 INFO L189 CegarLoopUtils]: For program point L112(lines 112 518) no Hoare annotation was computed. [2021-01-06 11:35:24,885 INFO L185 CegarLoopUtils]: At program point L146(lines 142 508) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2021-01-06 11:35:24,885 INFO L189 CegarLoopUtils]: For program point L213(lines 213 215) no Hoare annotation was computed. [2021-01-06 11:35:24,885 INFO L189 CegarLoopUtils]: For program point L213-2(lines 213 215) no Hoare annotation was computed. [2021-01-06 11:35:24,885 INFO L189 CegarLoopUtils]: For program point L181(lines 181 495) no Hoare annotation was computed. [2021-01-06 11:35:24,885 INFO L189 CegarLoopUtils]: For program point L148(lines 148 506) no Hoare annotation was computed. [2021-01-06 11:35:24,885 INFO L189 CegarLoopUtils]: For program point L115(lines 115 517) no Hoare annotation was computed. [2021-01-06 11:35:24,885 INFO L189 CegarLoopUtils]: For program point L479(lines 479 481) no Hoare annotation was computed. [2021-01-06 11:35:24,885 INFO L189 CegarLoopUtils]: For program point L446(lines 446 457) no Hoare annotation was computed. [2021-01-06 11:35:24,886 INFO L189 CegarLoopUtils]: For program point L413(lines 413 427) no Hoare annotation was computed. [2021-01-06 11:35:24,886 INFO L189 CegarLoopUtils]: For program point L413-1(lines 413 427) no Hoare annotation was computed. [2021-01-06 11:35:24,886 INFO L189 CegarLoopUtils]: For program point L446-2(lines 446 457) no Hoare annotation was computed. [2021-01-06 11:35:24,886 INFO L189 CegarLoopUtils]: For program point L314(lines 314 317) no Hoare annotation was computed. [2021-01-06 11:35:24,886 INFO L185 CegarLoopUtils]: At program point L182(lines 178 496) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2021-01-06 11:35:24,886 INFO L189 CegarLoopUtils]: For program point L546(lines 546 548) no Hoare annotation was computed. [2021-01-06 11:35:24,886 INFO L189 CegarLoopUtils]: For program point L546-2(lines 546 548) no Hoare annotation was computed. [2021-01-06 11:35:24,886 INFO L189 CegarLoopUtils]: For program point L349(lines 349 351) no Hoare annotation was computed. [2021-01-06 11:35:24,886 INFO L189 CegarLoopUtils]: For program point L184(lines 184 494) no Hoare annotation was computed. [2021-01-06 11:35:24,887 INFO L189 CegarLoopUtils]: For program point L151(lines 151 505) no Hoare annotation was computed. [2021-01-06 11:35:24,887 INFO L189 CegarLoopUtils]: For program point L118(lines 118 516) no Hoare annotation was computed. [2021-01-06 11:35:24,887 INFO L189 CegarLoopUtils]: For program point L383(lines 383 385) no Hoare annotation was computed. [2021-01-06 11:35:24,887 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 11:35:24,887 INFO L189 CegarLoopUtils]: For program point L284(lines 284 298) no Hoare annotation was computed. [2021-01-06 11:35:24,887 INFO L189 CegarLoopUtils]: For program point L218(lines 218 221) no Hoare annotation was computed. [2021-01-06 11:35:24,887 INFO L189 CegarLoopUtils]: For program point L284-2(lines 284 298) no Hoare annotation was computed. [2021-01-06 11:35:24,887 INFO L185 CegarLoopUtils]: At program point L152(lines 148 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2021-01-06 11:35:24,887 INFO L189 CegarLoopUtils]: For program point L86(lines 86 92) no Hoare annotation was computed. [2021-01-06 11:35:24,888 INFO L189 CegarLoopUtils]: For program point L417(lines 417 423) no Hoare annotation was computed. [2021-01-06 11:35:24,888 INFO L189 CegarLoopUtils]: For program point L252(lines 252 254) no Hoare annotation was computed. [2021-01-06 11:35:24,888 INFO L189 CegarLoopUtils]: For program point L252-2(lines 203 486) no Hoare annotation was computed. [2021-01-06 11:35:24,888 INFO L189 CegarLoopUtils]: For program point L451(lines 451 454) no Hoare annotation was computed. [2021-01-06 11:35:24,888 INFO L189 CegarLoopUtils]: For program point L187(lines 187 493) no Hoare annotation was computed. [2021-01-06 11:35:24,888 INFO L189 CegarLoopUtils]: For program point L154(lines 154 504) no Hoare annotation was computed. [2021-01-06 11:35:24,888 INFO L189 CegarLoopUtils]: For program point L121(lines 121 515) no Hoare annotation was computed. [2021-01-06 11:35:24,888 INFO L192 CegarLoopUtils]: At program point L551(lines 12 553) the Hoare annotation is: true [2021-01-06 11:35:24,888 INFO L185 CegarLoopUtils]: At program point L188(lines 184 494) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse2))) [2021-01-06 11:35:24,889 INFO L185 CegarLoopUtils]: At program point L122(lines 118 516) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2021-01-06 11:35:24,889 INFO L189 CegarLoopUtils]: For program point L89(lines 89 91) no Hoare annotation was computed. [2021-01-06 11:35:24,889 INFO L189 CegarLoopUtils]: For program point L89-2(lines 86 92) no Hoare annotation was computed. [2021-01-06 11:35:24,889 INFO L189 CegarLoopUtils]: For program point L288(lines 288 294) no Hoare annotation was computed. [2021-01-06 11:35:24,889 INFO L185 CegarLoopUtils]: At program point L487(lines 100 540) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse4 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse9 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse7 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse0 .cse5 .cse6 .cse2 .cse7) (and .cse8 .cse6) (and .cse3 .cse4 .cse9 .cse7) (and .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse9 (= ULTIMATE.start_ssl3_connect_~s__state~0 4416) .cse7) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 1) (= ULTIMATE.start_ssl3_connect_~s__state~0 4384)) (and .cse10 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1 .cse11) (and .cse1 .cse8 .cse7) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0) (= ULTIMATE.start_ssl3_connect_~s__state~0 4368)) (and .cse1 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0) .cse7))) [2021-01-06 11:35:24,889 INFO L189 CegarLoopUtils]: For program point L322(lines 322 324) no Hoare annotation was computed. [2021-01-06 11:35:24,890 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 11:35:24,890 INFO L189 CegarLoopUtils]: For program point L190(lines 190 492) no Hoare annotation was computed. [2021-01-06 11:35:24,890 INFO L189 CegarLoopUtils]: For program point L157(lines 157 503) no Hoare annotation was computed. [2021-01-06 11:35:24,890 INFO L189 CegarLoopUtils]: For program point L124(lines 124 514) no Hoare annotation was computed. [2021-01-06 11:35:24,890 INFO L189 CegarLoopUtils]: For program point L389(lines 389 393) no Hoare annotation was computed. [2021-01-06 11:35:24,890 INFO L185 CegarLoopUtils]: At program point L323(lines 77 552) the Hoare annotation is: false [2021-01-06 11:35:24,890 INFO L189 CegarLoopUtils]: For program point L389-2(lines 203 486) no Hoare annotation was computed. [2021-01-06 11:35:24,891 INFO L189 CegarLoopUtils]: For program point L224(lines 224 235) no Hoare annotation was computed. [2021-01-06 11:35:24,891 INFO L189 CegarLoopUtils]: For program point L224-2(lines 203 486) no Hoare annotation was computed. [2021-01-06 11:35:24,891 INFO L189 CegarLoopUtils]: For program point L522(lines 522 538) no Hoare annotation was computed. [2021-01-06 11:35:24,892 INFO L189 CegarLoopUtils]: For program point L291(lines 291 293) no Hoare annotation was computed. [2021-01-06 11:35:24,892 INFO L189 CegarLoopUtils]: For program point L291-2(lines 286 298) no Hoare annotation was computed. [2021-01-06 11:35:24,892 INFO L189 CegarLoopUtils]: For program point L523(lines 523 537) no Hoare annotation was computed. [2021-01-06 11:35:24,892 INFO L189 CegarLoopUtils]: For program point L358(lines 358 360) no Hoare annotation was computed. [2021-01-06 11:35:24,892 INFO L189 CegarLoopUtils]: For program point L325(lines 325 327) no Hoare annotation was computed. [2021-01-06 11:35:24,892 INFO L189 CegarLoopUtils]: For program point L226(lines 226 229) no Hoare annotation was computed. [2021-01-06 11:35:24,892 INFO L189 CegarLoopUtils]: For program point L193(lines 193 491) no Hoare annotation was computed. [2021-01-06 11:35:24,892 INFO L189 CegarLoopUtils]: For program point L160(lines 160 502) no Hoare annotation was computed. [2021-01-06 11:35:24,892 INFO L189 CegarLoopUtils]: For program point L127(lines 127 513) no Hoare annotation was computed. [2021-01-06 11:35:24,892 INFO L189 CegarLoopUtils]: For program point L94(lines 94 98) no Hoare annotation was computed. [2021-01-06 11:35:24,893 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 11:35:24,893 INFO L189 CegarLoopUtils]: For program point L524(lines 524 529) no Hoare annotation was computed. [2021-01-06 11:35:24,893 INFO L189 CegarLoopUtils]: For program point L524-2(lines 523 537) no Hoare annotation was computed. [2021-01-06 11:35:24,894 INFO L189 CegarLoopUtils]: For program point L260(lines 260 262) no Hoare annotation was computed. [2021-01-06 11:35:24,895 INFO L185 CegarLoopUtils]: At program point L194(lines 190 492) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2021-01-06 11:35:24,895 INFO L185 CegarLoopUtils]: At program point L128(lines 124 514) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 1) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2021-01-06 11:35:24,895 INFO L189 CegarLoopUtils]: For program point L95(lines 95 97) no Hoare annotation was computed. [2021-01-06 11:35:24,895 INFO L189 CegarLoopUtils]: For program point L526(lines 526 528) no Hoare annotation was computed. [2021-01-06 11:35:24,895 INFO L189 CegarLoopUtils]: For program point L196(lines 196 490) no Hoare annotation was computed. [2021-01-06 11:35:24,895 INFO L189 CegarLoopUtils]: For program point L163(lines 163 501) no Hoare annotation was computed. [2021-01-06 11:35:24,896 INFO L189 CegarLoopUtils]: For program point L130(lines 130 512) no Hoare annotation was computed. [2021-01-06 11:35:24,896 INFO L189 CegarLoopUtils]: For program point L362(lines 362 367) no Hoare annotation was computed. [2021-01-06 11:35:24,896 INFO L189 CegarLoopUtils]: For program point L362-2(lines 362 367) no Hoare annotation was computed. [2021-01-06 11:35:24,896 INFO L189 CegarLoopUtils]: For program point L230(lines 230 233) no Hoare annotation was computed. [2021-01-06 11:35:24,896 INFO L185 CegarLoopUtils]: At program point L197(lines 196 490) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2021-01-06 11:35:24,896 INFO L185 CegarLoopUtils]: At program point L164(lines 154 504) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2021-01-06 11:35:24,896 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 11:35:24,897 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 550) no Hoare annotation was computed. [2021-01-06 11:35:24,897 INFO L189 CegarLoopUtils]: For program point L462-1(lines 462 464) no Hoare annotation was computed. [2021-01-06 11:35:24,897 INFO L192 CegarLoopUtils]: At program point L562(lines 554 564) the Hoare annotation is: true [2021-01-06 11:35:24,897 INFO L189 CegarLoopUtils]: For program point L199(lines 199 489) no Hoare annotation was computed. [2021-01-06 11:35:24,897 INFO L189 CegarLoopUtils]: For program point L166(lines 166 500) no Hoare annotation was computed. [2021-01-06 11:35:24,897 INFO L189 CegarLoopUtils]: For program point L133(lines 133 511) no Hoare annotation was computed. [2021-01-06 11:35:24,897 INFO L189 CegarLoopUtils]: For program point L100-1(lines 77 552) no Hoare annotation was computed. [2021-01-06 11:35:24,897 INFO L189 CegarLoopUtils]: For program point L398(lines 398 401) no Hoare annotation was computed. [2021-01-06 11:35:24,897 INFO L192 CegarLoopUtils]: At program point L200(lines 199 489) the Hoare annotation is: true [2021-01-06 11:35:24,898 INFO L185 CegarLoopUtils]: At program point L134(lines 130 512) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) [2021-01-06 11:35:24,898 INFO L189 CegarLoopUtils]: For program point L101(line 101) no Hoare annotation was computed. [2021-01-06 11:35:24,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:35:24 BoogieIcfgContainer [2021-01-06 11:35:24,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:35:24,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:35:24,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:35:24,947 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:35:24,947 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:09" (3/4) ... [2021-01-06 11:35:24,951 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 11:35:24,983 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 11:35:24,984 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 11:35:24,985 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:35:24,986 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:35:25,097 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_clnt_4.cil-1.c-witness.graphml [2021-01-06 11:35:25,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:35:25,099 INFO L168 Benchmark]: Toolchain (without parser) took 17382.70 ms. Allocated memory was 162.5 MB in the beginning and 1.1 GB in the end (delta: 925.9 MB). Free memory was 136.9 MB in the beginning and 660.2 MB in the end (delta: -523.3 MB). Peak memory consumption was 403.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:25,099 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 162.5 MB. Free memory is still 134.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:35:25,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.10 ms. Allocated memory is still 162.5 MB. Free memory was 136.7 MB in the beginning and 122.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:25,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.80 ms. Allocated memory is still 162.5 MB. Free memory was 122.2 MB in the beginning and 119.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:25,100 INFO L168 Benchmark]: Boogie Preprocessor took 49.56 ms. Allocated memory is still 162.5 MB. Free memory was 119.5 MB in the beginning and 117.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:25,101 INFO L168 Benchmark]: RCFGBuilder took 1129.12 ms. Allocated memory is still 162.5 MB. Free memory was 117.4 MB in the beginning and 104.9 MB in the end (delta: 12.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:25,101 INFO L168 Benchmark]: TraceAbstraction took 15540.33 ms. Allocated memory was 162.5 MB in the beginning and 1.1 GB in the end (delta: 925.9 MB). Free memory was 104.3 MB in the beginning and 669.7 MB in the end (delta: -565.4 MB). Peak memory consumption was 361.0 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:25,101 INFO L168 Benchmark]: Witness Printer took 151.33 ms. Allocated memory is still 1.1 GB. Free memory was 669.7 MB in the beginning and 660.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:25,104 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 162.5 MB. Free memory is still 134.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 430.10 ms. Allocated memory is still 162.5 MB. Free memory was 136.7 MB in the beginning and 122.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 70.80 ms. Allocated memory is still 162.5 MB. Free memory was 122.2 MB in the beginning and 119.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 49.56 ms. Allocated memory is still 162.5 MB. Free memory was 119.5 MB in the beginning and 117.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1129.12 ms. Allocated memory is still 162.5 MB. Free memory was 117.4 MB in the beginning and 104.9 MB in the end (delta: 12.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15540.33 ms. Allocated memory was 162.5 MB in the beginning and 1.1 GB in the end (delta: 925.9 MB). Free memory was 104.3 MB in the beginning and 669.7 MB in the end (delta: -565.4 MB). Peak memory consumption was 361.0 MB. Max. memory is 8.0 GB. * Witness Printer took 151.33 ms. Allocated memory is still 1.1 GB. Free memory was 669.7 MB in the beginning and 660.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag == 0) && 4352 <= s__state - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((s__state <= 4352 && 4560 <= s__s3__tmp__next_state___0) && 4352 <= s__state) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) || (((s__state <= 4352 && s__s3__tmp__next_state___0 <= 3) && blastFlag == 2) && 4352 <= s__state) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: s__state <= 4352 && blastFlag == 0 - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && 4432 <= s__state) && blastFlag == 2) || (((s__state <= 4528 && 4432 <= s__state) && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag == 2) && 4352 <= s__state) && s__hit == 0 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && 4432 <= s__state) && blastFlag == 2) || (((s__state <= 4560 && 4432 <= s__state) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || (((s__state <= 4560 && 4432 <= s__state) && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && 4432 <= s__state) && blastFlag == 2) || (((s__state <= 4528 && 4432 <= s__state) && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: blastFlag == 0 && 12292 == s__state - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && 4432 <= s__state) && blastFlag == 2) || (((s__state <= 4528 && 4432 <= s__state) && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag == 1) && 4352 <= s__state - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && 4432 <= s__state) && blastFlag == 2) || (((s__state <= 4528 && 4432 <= s__state) && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 4560 && blastFlag == 2) && 4560 <= s__state) || ((s__state <= 4528 && 4432 <= s__state) && blastFlag == 2)) || ((((s__state <= 4560 && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && 4560 <= s__state) && s__hit == 0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && 4432 <= s__state) && blastFlag <= 4) && s__hit == 0)) || ((((s__state <= 4352 && 4560 <= s__s3__tmp__next_state___0) && 4352 <= s__state) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((blastFlag <= 4 && s__state == 4416) && s__hit == 0)) || (blastFlag == 1 && s__state == 4384)) || (((s__state <= 4352 && s__s3__tmp__next_state___0 <= 3) && blastFlag == 2) && 4352 <= s__state)) || ((blastFlag == 2 && s__state <= 3) && s__hit == 0)) || (blastFlag == 0 && s__state == 4368)) || ((blastFlag == 2 && 4400 == s__state) && s__hit == 0) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 4) && 4352 <= s__state) && s__hit == 0 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag == 2) && 4560 <= s__state) || ((((s__state <= 4560 && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && 4560 <= s__state) && s__hit == 0) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && 4432 <= s__state) && blastFlag == 2) || (((s__state <= 4528 && 4432 <= s__state) && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && 4432 <= s__state) && blastFlag == 2) || (((s__state <= 4528 && 4432 <= s__state) && blastFlag <= 4) && s__hit == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.6s, OverallIterations: 26, TraceHistogramMax: 18, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4934 SDtfs, 1570 SDslu, 2831 SDs, 0 SdLazy, 2491 SolverSat, 457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1274 GetRequests, 1242 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5989occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 4432 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 177 NumberOfFragments, 434 HoareAnnotationTreeSize, 22 FomulaSimplifications, 8973 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 2102 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 6603 NumberOfCodeBlocks, 6603 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6574 ConstructedInterpolants, 0 QuantifiedInterpolants, 2522458 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2139 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 23541/23607 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...