/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/bitvector/s3_clnt_3.BV.c.cil-1a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:32:28,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:32:28,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:32:29,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:32:29,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:32:29,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:32:29,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:32:29,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:32:29,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:32:29,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:32:29,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:32:29,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:32:29,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:32:29,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:32:29,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:32:29,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:32:29,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:32:29,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:32:29,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:32:29,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:32:29,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:32:29,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:32:29,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:32:29,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:32:29,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:32:29,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:32:29,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:32:29,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:32:29,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:32:29,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:32:29,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:32:29,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:32:29,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:32:29,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:32:29,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:32:29,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:32:29,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:32:29,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:32:29,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:32:29,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:32:29,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:32:29,104 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:32:29,133 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:32:29,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:32:29,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:32:29,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:32:29,136 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:32:29,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:32:29,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:32:29,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:32:29,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:32:29,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:32:29,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:32:29,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:32:29,138 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:32:29,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:32:29,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:32:29,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:32:29,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:32:29,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:32:29,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:32:29,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:32:29,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:32:29,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:32:29,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:32:29,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:32:29,140 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:32:29,140 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:32:29,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:32:29,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:32:29,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:32:29,616 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:32:29,617 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:32:29,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2021-01-06 11:32:29,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32e577e2b/c65308702aef4e48a7065b92247e0c96/FLAG22bdb4fea [2021-01-06 11:32:30,470 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:32:30,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2021-01-06 11:32:30,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32e577e2b/c65308702aef4e48a7065b92247e0c96/FLAG22bdb4fea [2021-01-06 11:32:30,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32e577e2b/c65308702aef4e48a7065b92247e0c96 [2021-01-06 11:32:30,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:32:30,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:32:30,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:32:30,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:32:30,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:32:30,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:32:30" (1/1) ... [2021-01-06 11:32:30,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba255e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:30, skipping insertion in model container [2021-01-06 11:32:30,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:32:30" (1/1) ... [2021-01-06 11:32:30,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:32:30,831 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[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~ag_Y~0,] left hand side expression in assignment: lhs: VariableLHS[~ag_Z~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__ctx__stats__sess_connect_renegotiate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~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__ctx__stats__sess_connect~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[~ag_X~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~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__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[~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[~s__state~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[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_hit~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_connect_good~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,] left hand side expression in assignment: lhs: VariableLHS[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres60~0,] [2021-01-06 11:32:31,105 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/bitvector/s3_clnt_3.BV.c.cil-1a.c[37478,37491] left hand side expression in assignment: lhs: VariableLHS[~__retres60~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2021-01-06 11:32:31,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:32:31,126 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[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~ag_Y~0,] left hand side expression in assignment: lhs: VariableLHS[~ag_Z~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__ctx__stats__sess_connect_renegotiate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~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__ctx__stats__sess_connect~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[~ag_X~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~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__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[~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[~s__state~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[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_hit~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_connect_good~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,] left hand side expression in assignment: lhs: VariableLHS[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres60~0,] [2021-01-06 11:32:31,251 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/bitvector/s3_clnt_3.BV.c.cil-1a.c[37478,37491] left hand side expression in assignment: lhs: VariableLHS[~__retres60~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2021-01-06 11:32:31,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:32:31,286 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:32:31,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:31 WrapperNode [2021-01-06 11:32:31,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:32:31,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:32:31,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:32:31,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:32:31,300 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:32:31" (1/1) ... [2021-01-06 11:32:31,333 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:32:31" (1/1) ... [2021-01-06 11:32:31,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:32:31,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:32:31,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:32:31,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:32:31,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:31" (1/1) ... [2021-01-06 11:32:31,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:31" (1/1) ... [2021-01-06 11:32:31,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:31" (1/1) ... [2021-01-06 11:32:31,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:31" (1/1) ... [2021-01-06 11:32:31,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:31" (1/1) ... [2021-01-06 11:32:31,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:31" (1/1) ... [2021-01-06 11:32:31,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:31" (1/1) ... [2021-01-06 11:32:31,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:32:31,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:32:31,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:32:31,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:32:31,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:31" (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:32:31,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:32:31,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:32:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:32:31,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:32:31,897 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:32:32,534 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-01-06 11:32:32,534 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-01-06 11:32:32,552 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:32:32,553 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:32:32,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:32:32 BoogieIcfgContainer [2021-01-06 11:32:32,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:32:32,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:32:32,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:32:32,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:32:32,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:32:30" (1/3) ... [2021-01-06 11:32:32,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89071fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:32:32, skipping insertion in model container [2021-01-06 11:32:32,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:31" (2/3) ... [2021-01-06 11:32:32,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89071fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:32:32, skipping insertion in model container [2021-01-06 11:32:32,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:32:32" (3/3) ... [2021-01-06 11:32:32,572 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2021-01-06 11:32:32,580 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:32:32,589 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:32:32,609 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:32:32,654 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:32:32,654 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:32:32,655 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:32:32,655 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:32:32,655 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:32:32,655 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:32:32,655 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:32:32,655 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:32:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2021-01-06 11:32:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 11:32:32,689 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:32,690 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:32,691 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash 260039818, now seen corresponding path program 1 times [2021-01-06 11:32:32,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:32,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335859425] [2021-01-06 11:32:32,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:33,050 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:32:33,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335859425] [2021-01-06 11:32:33,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:33,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:33,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793721796] [2021-01-06 11:32:33,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:33,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:33,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:33,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:33,081 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 3 states. [2021-01-06 11:32:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:33,397 INFO L93 Difference]: Finished difference Result 263 states and 455 transitions. [2021-01-06 11:32:33,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:33,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-01-06 11:32:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:33,424 INFO L225 Difference]: With dead ends: 263 [2021-01-06 11:32:33,425 INFO L226 Difference]: Without dead ends: 121 [2021-01-06 11:32:33,430 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:32:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-01-06 11:32:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-01-06 11:32:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2021-01-06 11:32:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2021-01-06 11:32:33,505 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 25 [2021-01-06 11:32:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:33,506 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2021-01-06 11:32:33,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2021-01-06 11:32:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 11:32:33,512 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:33,513 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:32:33,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:32:33,513 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:33,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:33,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1631610026, now seen corresponding path program 1 times [2021-01-06 11:32:33,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:33,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400884081] [2021-01-06 11:32:33,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:33,673 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:32:33,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400884081] [2021-01-06 11:32:33,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:33,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:33,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946399009] [2021-01-06 11:32:33,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:33,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:33,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:33,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:33,679 INFO L87 Difference]: Start difference. First operand 121 states and 187 transitions. Second operand 3 states. [2021-01-06 11:32:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:33,889 INFO L93 Difference]: Finished difference Result 249 states and 388 transitions. [2021-01-06 11:32:33,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:33,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2021-01-06 11:32:33,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:33,892 INFO L225 Difference]: With dead ends: 249 [2021-01-06 11:32:33,893 INFO L226 Difference]: Without dead ends: 139 [2021-01-06 11:32:33,894 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:32:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-01-06 11:32:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2021-01-06 11:32:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2021-01-06 11:32:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2021-01-06 11:32:33,907 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 207 transitions. Word has length 37 [2021-01-06 11:32:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:33,907 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 207 transitions. [2021-01-06 11:32:33,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 207 transitions. [2021-01-06 11:32:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:32:33,909 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:33,909 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:32:33,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:32:33,910 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1554238703, now seen corresponding path program 1 times [2021-01-06 11:32:33,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:33,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459621255] [2021-01-06 11:32:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:33,984 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:32:33,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459621255] [2021-01-06 11:32:33,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:33,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:33,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233725471] [2021-01-06 11:32:33,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:33,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:33,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:33,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:33,988 INFO L87 Difference]: Start difference. First operand 136 states and 207 transitions. Second operand 3 states. [2021-01-06 11:32:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:34,011 INFO L93 Difference]: Finished difference Result 287 states and 432 transitions. [2021-01-06 11:32:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:34,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2021-01-06 11:32:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:34,013 INFO L225 Difference]: With dead ends: 287 [2021-01-06 11:32:34,013 INFO L226 Difference]: Without dead ends: 162 [2021-01-06 11:32:34,015 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:32:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-01-06 11:32:34,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-01-06 11:32:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2021-01-06 11:32:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 240 transitions. [2021-01-06 11:32:34,027 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 240 transitions. Word has length 51 [2021-01-06 11:32:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:34,027 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 240 transitions. [2021-01-06 11:32:34,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2021-01-06 11:32:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:32:34,030 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:34,030 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:32:34,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:32:34,030 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:34,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:34,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1420225197, now seen corresponding path program 1 times [2021-01-06 11:32:34,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:34,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791507653] [2021-01-06 11:32:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:34,164 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:32:34,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791507653] [2021-01-06 11:32:34,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:34,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:34,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321620259] [2021-01-06 11:32:34,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:34,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:34,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:34,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:34,170 INFO L87 Difference]: Start difference. First operand 162 states and 240 transitions. Second operand 3 states. [2021-01-06 11:32:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:34,373 INFO L93 Difference]: Finished difference Result 308 states and 467 transitions. [2021-01-06 11:32:34,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:34,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2021-01-06 11:32:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:34,377 INFO L225 Difference]: With dead ends: 308 [2021-01-06 11:32:34,377 INFO L226 Difference]: Without dead ends: 183 [2021-01-06 11:32:34,380 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:32:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-01-06 11:32:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2021-01-06 11:32:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-06 11:32:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 262 transitions. [2021-01-06 11:32:34,408 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 262 transitions. Word has length 51 [2021-01-06 11:32:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:34,411 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 262 transitions. [2021-01-06 11:32:34,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 262 transitions. [2021-01-06 11:32:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 11:32:34,421 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:34,421 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, 1] [2021-01-06 11:32:34,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:32:34,422 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2017552045, now seen corresponding path program 1 times [2021-01-06 11:32:34,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:34,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179283666] [2021-01-06 11:32:34,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:34,572 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:32:34,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179283666] [2021-01-06 11:32:34,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:34,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:34,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149202799] [2021-01-06 11:32:34,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:34,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:34,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:34,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:34,577 INFO L87 Difference]: Start difference. First operand 179 states and 262 transitions. Second operand 3 states. [2021-01-06 11:32:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:34,824 INFO L93 Difference]: Finished difference Result 363 states and 553 transitions. [2021-01-06 11:32:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:34,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-06 11:32:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:34,826 INFO L225 Difference]: With dead ends: 363 [2021-01-06 11:32:34,827 INFO L226 Difference]: Without dead ends: 179 [2021-01-06 11:32:34,827 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:32:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-01-06 11:32:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2021-01-06 11:32:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-06 11:32:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 260 transitions. [2021-01-06 11:32:34,835 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 260 transitions. Word has length 69 [2021-01-06 11:32:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:34,836 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 260 transitions. [2021-01-06 11:32:34,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 260 transitions. [2021-01-06 11:32:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 11:32:34,838 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:34,838 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, 1, 1] [2021-01-06 11:32:34,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:32:34,838 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:34,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:34,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1856789330, now seen corresponding path program 1 times [2021-01-06 11:32:34,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:34,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471617139] [2021-01-06 11:32:34,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:34,917 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:32:34,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471617139] [2021-01-06 11:32:34,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:34,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:34,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818006286] [2021-01-06 11:32:34,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:34,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:34,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:34,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:34,919 INFO L87 Difference]: Start difference. First operand 179 states and 260 transitions. Second operand 3 states. [2021-01-06 11:32:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:34,996 INFO L93 Difference]: Finished difference Result 492 states and 718 transitions. [2021-01-06 11:32:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:34,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 11:32:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:35,004 INFO L225 Difference]: With dead ends: 492 [2021-01-06 11:32:35,004 INFO L226 Difference]: Without dead ends: 350 [2021-01-06 11:32:35,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:32:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-01-06 11:32:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2021-01-06 11:32:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2021-01-06 11:32:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 504 transitions. [2021-01-06 11:32:35,040 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 504 transitions. Word has length 70 [2021-01-06 11:32:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:35,041 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 504 transitions. [2021-01-06 11:32:35,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 504 transitions. [2021-01-06 11:32:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 11:32:35,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:35,052 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, 1, 1] [2021-01-06 11:32:35,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:32:35,053 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:35,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:35,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1069339995, now seen corresponding path program 1 times [2021-01-06 11:32:35,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:35,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011808012] [2021-01-06 11:32:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:35,176 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:32:35,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011808012] [2021-01-06 11:32:35,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:35,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:35,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523034737] [2021-01-06 11:32:35,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:35,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:35,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:35,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:35,180 INFO L87 Difference]: Start difference. First operand 348 states and 504 transitions. Second operand 3 states. [2021-01-06 11:32:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:35,233 INFO L93 Difference]: Finished difference Result 759 states and 1111 transitions. [2021-01-06 11:32:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:35,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 11:32:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:35,241 INFO L225 Difference]: With dead ends: 759 [2021-01-06 11:32:35,242 INFO L226 Difference]: Without dead ends: 477 [2021-01-06 11:32:35,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:35,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-01-06 11:32:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2021-01-06 11:32:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2021-01-06 11:32:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 685 transitions. [2021-01-06 11:32:35,280 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 685 transitions. Word has length 70 [2021-01-06 11:32:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:35,281 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 685 transitions. [2021-01-06 11:32:35,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 685 transitions. [2021-01-06 11:32:35,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 11:32:35,284 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:35,284 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, 1, 1] [2021-01-06 11:32:35,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:32:35,285 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:35,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:35,285 INFO L82 PathProgramCache]: Analyzing trace with hash 751998128, now seen corresponding path program 1 times [2021-01-06 11:32:35,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:35,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741499654] [2021-01-06 11:32:35,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:35,378 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:32:35,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741499654] [2021-01-06 11:32:35,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:35,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:35,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120914547] [2021-01-06 11:32:35,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:35,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:35,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:35,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:35,383 INFO L87 Difference]: Start difference. First operand 475 states and 685 transitions. Second operand 3 states. [2021-01-06 11:32:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:35,409 INFO L93 Difference]: Finished difference Result 479 states and 687 transitions. [2021-01-06 11:32:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:35,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 11:32:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:35,412 INFO L225 Difference]: With dead ends: 479 [2021-01-06 11:32:35,412 INFO L226 Difference]: Without dead ends: 341 [2021-01-06 11:32:35,413 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:32:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-01-06 11:32:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2021-01-06 11:32:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2021-01-06 11:32:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 482 transitions. [2021-01-06 11:32:35,426 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 482 transitions. Word has length 70 [2021-01-06 11:32:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:35,427 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 482 transitions. [2021-01-06 11:32:35,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 482 transitions. [2021-01-06 11:32:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 11:32:35,429 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:35,429 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, 1, 1] [2021-01-06 11:32:35,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:32:35,430 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1539447463, now seen corresponding path program 1 times [2021-01-06 11:32:35,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:35,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414872759] [2021-01-06 11:32:35,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:35,517 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:32:35,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414872759] [2021-01-06 11:32:35,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:35,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:35,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675004061] [2021-01-06 11:32:35,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:35,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:35,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:35,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:35,527 INFO L87 Difference]: Start difference. First operand 339 states and 482 transitions. Second operand 3 states. [2021-01-06 11:32:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:35,567 INFO L93 Difference]: Finished difference Result 478 states and 682 transitions. [2021-01-06 11:32:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:35,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 11:32:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:35,571 INFO L225 Difference]: With dead ends: 478 [2021-01-06 11:32:35,571 INFO L226 Difference]: Without dead ends: 341 [2021-01-06 11:32:35,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:32:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-01-06 11:32:35,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2021-01-06 11:32:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2021-01-06 11:32:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 480 transitions. [2021-01-06 11:32:35,593 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 480 transitions. Word has length 70 [2021-01-06 11:32:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:35,594 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 480 transitions. [2021-01-06 11:32:35,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 480 transitions. [2021-01-06 11:32:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 11:32:35,595 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:35,595 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, 1, 1, 1, 1] [2021-01-06 11:32:35,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:32:35,596 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:35,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:35,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1979994253, now seen corresponding path program 1 times [2021-01-06 11:32:35,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:35,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160641207] [2021-01-06 11:32:35,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:35,641 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:32:35,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160641207] [2021-01-06 11:32:35,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:35,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:35,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995717608] [2021-01-06 11:32:35,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:35,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:35,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:35,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:35,644 INFO L87 Difference]: Start difference. First operand 339 states and 480 transitions. Second operand 3 states. [2021-01-06 11:32:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:35,691 INFO L93 Difference]: Finished difference Result 881 states and 1267 transitions. [2021-01-06 11:32:35,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:35,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 11:32:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:35,696 INFO L225 Difference]: With dead ends: 881 [2021-01-06 11:32:35,696 INFO L226 Difference]: Without dead ends: 608 [2021-01-06 11:32:35,697 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:32:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-01-06 11:32:35,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2021-01-06 11:32:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2021-01-06 11:32:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 860 transitions. [2021-01-06 11:32:35,717 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 860 transitions. Word has length 72 [2021-01-06 11:32:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:35,717 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 860 transitions. [2021-01-06 11:32:35,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 860 transitions. [2021-01-06 11:32:35,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 11:32:35,719 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:35,719 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, 1, 1, 1, 1, 1] [2021-01-06 11:32:35,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:32:35,719 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:35,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:35,720 INFO L82 PathProgramCache]: Analyzing trace with hash -663990389, now seen corresponding path program 1 times [2021-01-06 11:32:35,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:35,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371804364] [2021-01-06 11:32:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:32:35,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371804364] [2021-01-06 11:32:35,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:35,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:35,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923094789] [2021-01-06 11:32:35,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:35,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:35,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:35,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:35,759 INFO L87 Difference]: Start difference. First operand 608 states and 860 transitions. Second operand 3 states. [2021-01-06 11:32:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:35,811 INFO L93 Difference]: Finished difference Result 1192 states and 1691 transitions. [2021-01-06 11:32:35,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:35,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 11:32:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:35,815 INFO L225 Difference]: With dead ends: 1192 [2021-01-06 11:32:35,815 INFO L226 Difference]: Without dead ends: 650 [2021-01-06 11:32:35,816 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:32:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2021-01-06 11:32:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2021-01-06 11:32:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2021-01-06 11:32:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 914 transitions. [2021-01-06 11:32:35,835 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 914 transitions. Word has length 73 [2021-01-06 11:32:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:35,835 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 914 transitions. [2021-01-06 11:32:35,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 914 transitions. [2021-01-06 11:32:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:32:35,840 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:35,840 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, 1, 1, 1, 1, 1] [2021-01-06 11:32:35,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:32:35,840 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1666060429, now seen corresponding path program 1 times [2021-01-06 11:32:35,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:35,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065375604] [2021-01-06 11:32:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:35,902 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:32:35,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065375604] [2021-01-06 11:32:35,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:35,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:35,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534933915] [2021-01-06 11:32:35,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:35,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:35,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:35,905 INFO L87 Difference]: Start difference. First operand 650 states and 914 transitions. Second operand 3 states. [2021-01-06 11:32:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:36,083 INFO L93 Difference]: Finished difference Result 1330 states and 1909 transitions. [2021-01-06 11:32:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:36,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 11:32:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:36,088 INFO L225 Difference]: With dead ends: 1330 [2021-01-06 11:32:36,088 INFO L226 Difference]: Without dead ends: 746 [2021-01-06 11:32:36,089 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:32:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-01-06 11:32:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 734. [2021-01-06 11:32:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2021-01-06 11:32:36,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1018 transitions. [2021-01-06 11:32:36,110 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1018 transitions. Word has length 90 [2021-01-06 11:32:36,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:36,110 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 1018 transitions. [2021-01-06 11:32:36,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1018 transitions. [2021-01-06 11:32:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-06 11:32:36,113 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:36,113 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, 1, 1, 1] [2021-01-06 11:32:36,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:32:36,114 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:36,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:36,114 INFO L82 PathProgramCache]: Analyzing trace with hash -809022581, now seen corresponding path program 1 times [2021-01-06 11:32:36,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:36,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327089453] [2021-01-06 11:32:36,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:36,167 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:32:36,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327089453] [2021-01-06 11:32:36,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:36,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:36,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064755661] [2021-01-06 11:32:36,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:36,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:36,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:36,170 INFO L87 Difference]: Start difference. First operand 734 states and 1018 transitions. Second operand 3 states. [2021-01-06 11:32:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:36,223 INFO L93 Difference]: Finished difference Result 1049 states and 1465 transitions. [2021-01-06 11:32:36,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:36,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2021-01-06 11:32:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:36,230 INFO L225 Difference]: With dead ends: 1049 [2021-01-06 11:32:36,230 INFO L226 Difference]: Without dead ends: 1047 [2021-01-06 11:32:36,231 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:32:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2021-01-06 11:32:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2021-01-06 11:32:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2021-01-06 11:32:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1462 transitions. [2021-01-06 11:32:36,261 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1462 transitions. Word has length 110 [2021-01-06 11:32:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:36,261 INFO L481 AbstractCegarLoop]: Abstraction has 1047 states and 1462 transitions. [2021-01-06 11:32:36,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1462 transitions. [2021-01-06 11:32:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-01-06 11:32:36,265 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:36,265 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 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] [2021-01-06 11:32:36,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:32:36,265 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2021159997, now seen corresponding path program 1 times [2021-01-06 11:32:36,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:36,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401656626] [2021-01-06 11:32:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-01-06 11:32:36,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401656626] [2021-01-06 11:32:36,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:36,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:36,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567443380] [2021-01-06 11:32:36,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:36,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:36,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:36,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:36,361 INFO L87 Difference]: Start difference. First operand 1047 states and 1462 transitions. Second operand 3 states. [2021-01-06 11:32:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:36,590 INFO L93 Difference]: Finished difference Result 2322 states and 3361 transitions. [2021-01-06 11:32:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:36,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2021-01-06 11:32:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:36,598 INFO L225 Difference]: With dead ends: 2322 [2021-01-06 11:32:36,599 INFO L226 Difference]: Without dead ends: 1335 [2021-01-06 11:32:36,601 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:32:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2021-01-06 11:32:36,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1287. [2021-01-06 11:32:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2021-01-06 11:32:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1852 transitions. [2021-01-06 11:32:36,640 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1852 transitions. Word has length 132 [2021-01-06 11:32:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:36,640 INFO L481 AbstractCegarLoop]: Abstraction has 1287 states and 1852 transitions. [2021-01-06 11:32:36,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1852 transitions. [2021-01-06 11:32:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 11:32:36,644 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:36,645 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 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, 1, 1, 1, 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:32:36,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:32:36,645 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:36,646 INFO L82 PathProgramCache]: Analyzing trace with hash 505572298, now seen corresponding path program 1 times [2021-01-06 11:32:36,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:36,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274319928] [2021-01-06 11:32:36,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-01-06 11:32:36,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274319928] [2021-01-06 11:32:36,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:36,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:36,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539649509] [2021-01-06 11:32:36,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:36,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:36,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:36,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:36,715 INFO L87 Difference]: Start difference. First operand 1287 states and 1852 transitions. Second operand 3 states. [2021-01-06 11:32:36,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:36,962 INFO L93 Difference]: Finished difference Result 3062 states and 4552 transitions. [2021-01-06 11:32:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:36,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2021-01-06 11:32:36,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:36,972 INFO L225 Difference]: With dead ends: 3062 [2021-01-06 11:32:36,973 INFO L226 Difference]: Without dead ends: 1739 [2021-01-06 11:32:36,975 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:32:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2021-01-06 11:32:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1665. [2021-01-06 11:32:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2021-01-06 11:32:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2356 transitions. [2021-01-06 11:32:37,031 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2356 transitions. Word has length 158 [2021-01-06 11:32:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:37,032 INFO L481 AbstractCegarLoop]: Abstraction has 1665 states and 2356 transitions. [2021-01-06 11:32:37,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2356 transitions. [2021-01-06 11:32:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-01-06 11:32:37,037 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:37,037 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 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, 1, 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:32:37,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:32:37,037 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:37,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:37,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1615904047, now seen corresponding path program 1 times [2021-01-06 11:32:37,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:37,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139379995] [2021-01-06 11:32:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2021-01-06 11:32:37,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139379995] [2021-01-06 11:32:37,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:37,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:37,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843344516] [2021-01-06 11:32:37,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:37,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:37,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:37,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:37,114 INFO L87 Difference]: Start difference. First operand 1665 states and 2356 transitions. Second operand 3 states. [2021-01-06 11:32:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:37,371 INFO L93 Difference]: Finished difference Result 3576 states and 5107 transitions. [2021-01-06 11:32:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:37,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2021-01-06 11:32:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:37,384 INFO L225 Difference]: With dead ends: 3576 [2021-01-06 11:32:37,385 INFO L226 Difference]: Without dead ends: 1887 [2021-01-06 11:32:37,388 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:32:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2021-01-06 11:32:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1815. [2021-01-06 11:32:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2021-01-06 11:32:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2548 transitions. [2021-01-06 11:32:37,485 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2548 transitions. Word has length 179 [2021-01-06 11:32:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:37,485 INFO L481 AbstractCegarLoop]: Abstraction has 1815 states and 2548 transitions. [2021-01-06 11:32:37,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2548 transitions. [2021-01-06 11:32:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-01-06 11:32:37,493 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:37,493 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:37,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:32:37,494 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash -68206532, now seen corresponding path program 1 times [2021-01-06 11:32:37,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:37,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113248106] [2021-01-06 11:32:37,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-01-06 11:32:37,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113248106] [2021-01-06 11:32:37,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:37,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:37,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660814474] [2021-01-06 11:32:37,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:37,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:37,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:37,620 INFO L87 Difference]: Start difference. First operand 1815 states and 2548 transitions. Second operand 3 states. [2021-01-06 11:32:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:37,875 INFO L93 Difference]: Finished difference Result 3876 states and 5485 transitions. [2021-01-06 11:32:37,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:37,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2021-01-06 11:32:37,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:37,886 INFO L225 Difference]: With dead ends: 3876 [2021-01-06 11:32:37,887 INFO L226 Difference]: Without dead ends: 2049 [2021-01-06 11:32:37,890 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:32:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2021-01-06 11:32:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1983. [2021-01-06 11:32:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2021-01-06 11:32:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2770 transitions. [2021-01-06 11:32:37,952 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2770 transitions. Word has length 203 [2021-01-06 11:32:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:37,952 INFO L481 AbstractCegarLoop]: Abstraction has 1983 states and 2770 transitions. [2021-01-06 11:32:37,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2770 transitions. [2021-01-06 11:32:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-01-06 11:32:37,958 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:37,958 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:37,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:32:37,959 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:37,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:37,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1035557186, now seen corresponding path program 1 times [2021-01-06 11:32:37,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:37,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083127599] [2021-01-06 11:32:37,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-01-06 11:32:38,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083127599] [2021-01-06 11:32:38,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:38,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:38,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780066896] [2021-01-06 11:32:38,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:38,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:38,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:38,083 INFO L87 Difference]: Start difference. First operand 1983 states and 2770 transitions. Second operand 3 states. [2021-01-06 11:32:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:38,313 INFO L93 Difference]: Finished difference Result 4212 states and 5935 transitions. [2021-01-06 11:32:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:38,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2021-01-06 11:32:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:38,325 INFO L225 Difference]: With dead ends: 4212 [2021-01-06 11:32:38,325 INFO L226 Difference]: Without dead ends: 2241 [2021-01-06 11:32:38,330 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:32:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2021-01-06 11:32:38,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2169. [2021-01-06 11:32:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2021-01-06 11:32:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3034 transitions. [2021-01-06 11:32:38,418 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3034 transitions. Word has length 203 [2021-01-06 11:32:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:38,418 INFO L481 AbstractCegarLoop]: Abstraction has 2169 states and 3034 transitions. [2021-01-06 11:32:38,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3034 transitions. [2021-01-06 11:32:38,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-01-06 11:32:38,425 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:38,426 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2021-01-06 11:32:38,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:32:38,426 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:38,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:38,426 INFO L82 PathProgramCache]: Analyzing trace with hash 454348542, now seen corresponding path program 1 times [2021-01-06 11:32:38,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:38,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300706270] [2021-01-06 11:32:38,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2021-01-06 11:32:38,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300706270] [2021-01-06 11:32:38,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:38,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:38,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320526554] [2021-01-06 11:32:38,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:38,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:38,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:38,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:38,570 INFO L87 Difference]: Start difference. First operand 2169 states and 3034 transitions. Second operand 3 states. [2021-01-06 11:32:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:38,809 INFO L93 Difference]: Finished difference Result 4578 states and 6451 transitions. [2021-01-06 11:32:38,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:38,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2021-01-06 11:32:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:38,822 INFO L225 Difference]: With dead ends: 4578 [2021-01-06 11:32:38,823 INFO L226 Difference]: Without dead ends: 2445 [2021-01-06 11:32:38,826 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:32:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2021-01-06 11:32:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2379. [2021-01-06 11:32:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2021-01-06 11:32:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3346 transitions. [2021-01-06 11:32:38,913 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3346 transitions. Word has length 233 [2021-01-06 11:32:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:38,914 INFO L481 AbstractCegarLoop]: Abstraction has 2379 states and 3346 transitions. [2021-01-06 11:32:38,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3346 transitions. [2021-01-06 11:32:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-01-06 11:32:38,924 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:38,924 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 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] [2021-01-06 11:32:38,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:32:38,925 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2054712224, now seen corresponding path program 1 times [2021-01-06 11:32:38,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:38,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781888544] [2021-01-06 11:32:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2021-01-06 11:32:39,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781888544] [2021-01-06 11:32:39,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:39,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:39,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518915214] [2021-01-06 11:32:39,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:39,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:39,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:39,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:39,118 INFO L87 Difference]: Start difference. First operand 2379 states and 3346 transitions. Second operand 3 states. [2021-01-06 11:32:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:39,364 INFO L93 Difference]: Finished difference Result 4758 states and 6685 transitions. [2021-01-06 11:32:39,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:39,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2021-01-06 11:32:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:39,378 INFO L225 Difference]: With dead ends: 4758 [2021-01-06 11:32:39,378 INFO L226 Difference]: Without dead ends: 2427 [2021-01-06 11:32:39,382 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:32:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2021-01-06 11:32:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2361. [2021-01-06 11:32:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2361 states. [2021-01-06 11:32:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3292 transitions. [2021-01-06 11:32:39,455 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3292 transitions. Word has length 268 [2021-01-06 11:32:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:39,455 INFO L481 AbstractCegarLoop]: Abstraction has 2361 states and 3292 transitions. [2021-01-06 11:32:39,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3292 transitions. [2021-01-06 11:32:39,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2021-01-06 11:32:39,464 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:39,464 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 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, 1, 1] [2021-01-06 11:32:39,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:32:39,465 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:39,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:39,465 INFO L82 PathProgramCache]: Analyzing trace with hash -671382342, now seen corresponding path program 1 times [2021-01-06 11:32:39,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:39,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633842682] [2021-01-06 11:32:39,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2021-01-06 11:32:39,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633842682] [2021-01-06 11:32:39,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:39,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:39,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827000080] [2021-01-06 11:32:39,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:39,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:39,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:39,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:39,628 INFO L87 Difference]: Start difference. First operand 2361 states and 3292 transitions. Second operand 3 states. [2021-01-06 11:32:39,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:39,862 INFO L93 Difference]: Finished difference Result 4710 states and 6565 transitions. [2021-01-06 11:32:39,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:39,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2021-01-06 11:32:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:39,875 INFO L225 Difference]: With dead ends: 4710 [2021-01-06 11:32:39,875 INFO L226 Difference]: Without dead ends: 2415 [2021-01-06 11:32:39,879 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:32:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2021-01-06 11:32:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2361. [2021-01-06 11:32:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2361 states. [2021-01-06 11:32:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3238 transitions. [2021-01-06 11:32:39,953 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3238 transitions. Word has length 278 [2021-01-06 11:32:39,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:39,954 INFO L481 AbstractCegarLoop]: Abstraction has 2361 states and 3238 transitions. [2021-01-06 11:32:39,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3238 transitions. [2021-01-06 11:32:39,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2021-01-06 11:32:39,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:39,962 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:39,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:32:39,962 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:39,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:39,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1156408394, now seen corresponding path program 1 times [2021-01-06 11:32:39,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:39,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147181211] [2021-01-06 11:32:39,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2021-01-06 11:32:40,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147181211] [2021-01-06 11:32:40,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:40,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:40,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778713249] [2021-01-06 11:32:40,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:40,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:40,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:40,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:40,109 INFO L87 Difference]: Start difference. First operand 2361 states and 3238 transitions. Second operand 3 states. [2021-01-06 11:32:40,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:40,318 INFO L93 Difference]: Finished difference Result 4953 states and 6742 transitions. [2021-01-06 11:32:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:40,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2021-01-06 11:32:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:40,331 INFO L225 Difference]: With dead ends: 4953 [2021-01-06 11:32:40,332 INFO L226 Difference]: Without dead ends: 2658 [2021-01-06 11:32:40,336 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:32:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2021-01-06 11:32:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2448. [2021-01-06 11:32:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2448 states. [2021-01-06 11:32:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3355 transitions. [2021-01-06 11:32:40,429 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3355 transitions. Word has length 305 [2021-01-06 11:32:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:40,430 INFO L481 AbstractCegarLoop]: Abstraction has 2448 states and 3355 transitions. [2021-01-06 11:32:40,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3355 transitions. [2021-01-06 11:32:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2021-01-06 11:32:40,437 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:40,437 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:40,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:32:40,438 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash 619350975, now seen corresponding path program 1 times [2021-01-06 11:32:40,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:40,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809367324] [2021-01-06 11:32:40,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2021-01-06 11:32:40,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809367324] [2021-01-06 11:32:40,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:40,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:40,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267258388] [2021-01-06 11:32:40,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:40,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:40,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:40,563 INFO L87 Difference]: Start difference. First operand 2448 states and 3355 transitions. Second operand 3 states. [2021-01-06 11:32:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:40,785 INFO L93 Difference]: Finished difference Result 4992 states and 6787 transitions. [2021-01-06 11:32:40,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:40,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2021-01-06 11:32:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:40,813 INFO L225 Difference]: With dead ends: 4992 [2021-01-06 11:32:40,813 INFO L226 Difference]: Without dead ends: 2349 [2021-01-06 11:32:40,822 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:32:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2021-01-06 11:32:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2343. [2021-01-06 11:32:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2343 states. [2021-01-06 11:32:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3199 transitions. [2021-01-06 11:32:40,904 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3199 transitions. Word has length 306 [2021-01-06 11:32:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:40,905 INFO L481 AbstractCegarLoop]: Abstraction has 2343 states and 3199 transitions. [2021-01-06 11:32:40,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3199 transitions. [2021-01-06 11:32:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2021-01-06 11:32:40,914 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:40,914 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 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:32:40,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:32:40,916 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1977728998, now seen corresponding path program 1 times [2021-01-06 11:32:40,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:40,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169680594] [2021-01-06 11:32:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2021-01-06 11:32:41,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169680594] [2021-01-06 11:32:41,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750320971] [2021-01-06 11:32:41,148 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:32:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:41,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 11:32:41,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 384 proven. 12 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2021-01-06 11:32:41,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:32:41,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-06 11:32:41,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707192804] [2021-01-06 11:32:41,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:32:41,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:41,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:32:41,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:32:41,901 INFO L87 Difference]: Start difference. First operand 2343 states and 3199 transitions. Second operand 6 states. [2021-01-06 11:32:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:42,624 INFO L93 Difference]: Finished difference Result 5675 states and 7940 transitions. [2021-01-06 11:32:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 11:32:42,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 316 [2021-01-06 11:32:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:42,633 INFO L225 Difference]: With dead ends: 5675 [2021-01-06 11:32:42,633 INFO L226 Difference]: Without dead ends: 3314 [2021-01-06 11:32:42,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:32:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2021-01-06 11:32:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2631. [2021-01-06 11:32:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2021-01-06 11:32:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3612 transitions. [2021-01-06 11:32:42,723 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3612 transitions. Word has length 316 [2021-01-06 11:32:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:42,724 INFO L481 AbstractCegarLoop]: Abstraction has 2631 states and 3612 transitions. [2021-01-06 11:32:42,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:32:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3612 transitions. [2021-01-06 11:32:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2021-01-06 11:32:42,730 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:42,730 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 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, 1] [2021-01-06 11:32:42,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-01-06 11:32:42,944 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash -761229711, now seen corresponding path program 1 times [2021-01-06 11:32:42,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:42,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735160476] [2021-01-06 11:32:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2021-01-06 11:32:43,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735160476] [2021-01-06 11:32:43,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026800489] [2021-01-06 11:32:43,140 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:32:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:43,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 11:32:43,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2021-01-06 11:32:43,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:32:43,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-01-06 11:32:43,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050682740] [2021-01-06 11:32:43,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:32:43,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:43,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:32:43,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:32:43,727 INFO L87 Difference]: Start difference. First operand 2631 states and 3612 transitions. Second operand 5 states. [2021-01-06 11:32:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:44,129 INFO L93 Difference]: Finished difference Result 3853 states and 5281 transitions. [2021-01-06 11:32:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:32:44,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 317 [2021-01-06 11:32:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:44,137 INFO L225 Difference]: With dead ends: 3853 [2021-01-06 11:32:44,138 INFO L226 Difference]: Without dead ends: 2658 [2021-01-06 11:32:44,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:32:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2021-01-06 11:32:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2586. [2021-01-06 11:32:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2021-01-06 11:32:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3543 transitions. [2021-01-06 11:32:44,259 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3543 transitions. Word has length 317 [2021-01-06 11:32:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:44,260 INFO L481 AbstractCegarLoop]: Abstraction has 2586 states and 3543 transitions. [2021-01-06 11:32:44,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:32:44,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3543 transitions. [2021-01-06 11:32:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2021-01-06 11:32:44,269 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:44,269 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:44,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-06 11:32:44,485 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:44,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:44,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2066727537, now seen corresponding path program 1 times [2021-01-06 11:32:44,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:44,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030041176] [2021-01-06 11:32:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 653 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2021-01-06 11:32:44,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030041176] [2021-01-06 11:32:44,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958603122] [2021-01-06 11:32:44,728 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:32:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:44,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 11:32:44,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2021-01-06 11:32:45,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:32:45,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-01-06 11:32:45,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480319835] [2021-01-06 11:32:45,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:32:45,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:45,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:32:45,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:32:45,343 INFO L87 Difference]: Start difference. First operand 2586 states and 3543 transitions. Second operand 5 states. [2021-01-06 11:32:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:45,617 INFO L93 Difference]: Finished difference Result 3606 states and 4893 transitions. [2021-01-06 11:32:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:32:45,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 342 [2021-01-06 11:32:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:45,621 INFO L225 Difference]: With dead ends: 3606 [2021-01-06 11:32:45,621 INFO L226 Difference]: Without dead ends: 1187 [2021-01-06 11:32:45,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:32:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2021-01-06 11:32:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2021-01-06 11:32:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2021-01-06 11:32:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1616 transitions. [2021-01-06 11:32:45,655 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1616 transitions. Word has length 342 [2021-01-06 11:32:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:45,656 INFO L481 AbstractCegarLoop]: Abstraction has 1187 states and 1616 transitions. [2021-01-06 11:32:45,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:32:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1616 transitions. [2021-01-06 11:32:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2021-01-06 11:32:45,660 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:45,660 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 10, 10, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-01-06 11:32:45,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-06 11:32:45,873 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1232901937, now seen corresponding path program 1 times [2021-01-06 11:32:45,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:45,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483550885] [2021-01-06 11:32:45,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 813 proven. 12 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2021-01-06 11:32:46,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483550885] [2021-01-06 11:32:46,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102017137] [2021-01-06 11:32:46,065 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:46,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:32:46,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 813 proven. 12 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2021-01-06 11:32:46,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:32:46,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:32:46,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854317197] [2021-01-06 11:32:46,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:32:46,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:46,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:32:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:32:46,634 INFO L87 Difference]: Start difference. First operand 1187 states and 1616 transitions. Second operand 4 states. [2021-01-06 11:32:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:46,934 INFO L93 Difference]: Finished difference Result 1984 states and 2716 transitions. [2021-01-06 11:32:46,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:32:46,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2021-01-06 11:32:46,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:46,935 INFO L225 Difference]: With dead ends: 1984 [2021-01-06 11:32:46,935 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 11:32:46,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 395 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:32:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 11:32:46,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 11:32:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 11:32:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 11:32:46,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 393 [2021-01-06 11:32:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:46,939 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 11:32:46,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:32:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 11:32:46,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 11:32:47,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:47,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 11:32:47,463 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 123 [2021-01-06 11:32:47,661 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 75 [2021-01-06 11:32:47,973 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2021-01-06 11:32:48,168 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2021-01-06 11:32:49,030 WARN L197 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 42 [2021-01-06 11:32:49,208 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2021-01-06 11:32:49,388 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2021-01-06 11:32:49,498 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2021-01-06 11:32:49,751 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2021-01-06 11:32:50,737 WARN L197 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2021-01-06 11:32:50,844 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2021-01-06 11:32:50,853 INFO L189 CegarLoopUtils]: For program point L465(lines 465 471) no Hoare annotation was computed. [2021-01-06 11:32:50,854 INFO L192 CegarLoopUtils]: At program point L201(lines 200 541) the Hoare annotation is: true [2021-01-06 11:32:50,854 INFO L185 CegarLoopUtils]: At program point L135(lines 131 564) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse4 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352)) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0)) (and .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48) .cse5 .cse0))) [2021-01-06 11:32:50,854 INFO L189 CegarLoopUtils]: For program point L102(line 102) no Hoare annotation was computed. [2021-01-06 11:32:50,854 INFO L189 CegarLoopUtils]: For program point L235(lines 235 240) no Hoare annotation was computed. [2021-01-06 11:32:50,855 INFO L192 CegarLoopUtils]: At program point L632(lines 624 634) the Hoare annotation is: true [2021-01-06 11:32:50,855 INFO L189 CegarLoopUtils]: For program point L302(lines 302 306) no Hoare annotation was computed. [2021-01-06 11:32:50,855 INFO L189 CegarLoopUtils]: For program point L170(lines 170 551) no Hoare annotation was computed. [2021-01-06 11:32:50,855 INFO L189 CegarLoopUtils]: For program point L137(lines 137 562) no Hoare annotation was computed. [2021-01-06 11:32:50,856 INFO L189 CegarLoopUtils]: For program point L104(lines 104 573) no Hoare annotation was computed. [2021-01-06 11:32:50,856 INFO L189 CegarLoopUtils]: For program point L435(lines 435 439) no Hoare annotation was computed. [2021-01-06 11:32:50,856 INFO L189 CegarLoopUtils]: For program point L435-2(lines 205 537) no Hoare annotation was computed. [2021-01-06 11:32:50,858 INFO L189 CegarLoopUtils]: For program point L303(line 303) no Hoare annotation was computed. [2021-01-06 11:32:50,858 INFO L189 CegarLoopUtils]: For program point L303-2(line 303) no Hoare annotation was computed. [2021-01-06 11:32:50,859 INFO L192 CegarLoopUtils]: At program point L204(lines 203 540) the Hoare annotation is: true [2021-01-06 11:32:50,860 INFO L185 CegarLoopUtils]: At program point L171(lines 167 552) the Hoare annotation is: (let ((.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352)) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and (not .cse0) .cse1 .cse2 .cse3 .cse4 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse5) (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48) .cse4 .cse5 .cse0))) [2021-01-06 11:32:50,861 INFO L189 CegarLoopUtils]: For program point L303-4(line 303) no Hoare annotation was computed. [2021-01-06 11:32:50,863 INFO L185 CegarLoopUtils]: At program point L105(lines 104 573) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (let ((.cse5 (not .cse4)) (.cse8 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0)) (.cse7 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse6 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse0 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse1 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352)) (.cse3 (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse0 .cse7 .cse2 .cse3) (and .cse8 .cse1 .cse3 .cse4) (and .cse5 .cse8 .cse7 .cse3) (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse4)))) [2021-01-06 11:32:50,864 INFO L189 CegarLoopUtils]: For program point L303-6(line 303) no Hoare annotation was computed. [2021-01-06 11:32:50,864 INFO L189 CegarLoopUtils]: For program point L370(lines 370 374) no Hoare annotation was computed. [2021-01-06 11:32:50,864 INFO L189 CegarLoopUtils]: For program point L404(lines 404 409) no Hoare annotation was computed. [2021-01-06 11:32:50,864 INFO L189 CegarLoopUtils]: For program point L404-2(lines 404 409) no Hoare annotation was computed. [2021-01-06 11:32:50,864 INFO L189 CegarLoopUtils]: For program point L305(line 305) no Hoare annotation was computed. [2021-01-06 11:32:50,864 INFO L189 CegarLoopUtils]: For program point L305-2(line 305) no Hoare annotation was computed. [2021-01-06 11:32:50,865 INFO L189 CegarLoopUtils]: For program point L173(lines 173 550) no Hoare annotation was computed. [2021-01-06 11:32:50,865 INFO L189 CegarLoopUtils]: For program point L305-4(line 305) no Hoare annotation was computed. [2021-01-06 11:32:50,865 INFO L189 CegarLoopUtils]: For program point L140(lines 140 561) no Hoare annotation was computed. [2021-01-06 11:32:50,865 INFO L189 CegarLoopUtils]: For program point L107(lines 107 572) no Hoare annotation was computed. [2021-01-06 11:32:50,865 INFO L189 CegarLoopUtils]: For program point L305-6(line 305) no Hoare annotation was computed. [2021-01-06 11:32:50,866 INFO L189 CegarLoopUtils]: For program point L305-8(lines 302 306) no Hoare annotation was computed. [2021-01-06 11:32:50,866 INFO L185 CegarLoopUtils]: At program point L141(lines 137 562) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48) .cse4 .cse5) (and (not .cse5) .cse0 .cse1 .cse2 .cse3 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse4))) [2021-01-06 11:32:50,867 INFO L185 CegarLoopUtils]: At program point L538(lines 101 604) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse5 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 1)) (.cse14 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0)) (.cse13 (= ULTIMATE.start_ssl3_connect_~s__state~0 4368)) (.cse9 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse15 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse16 (= ULTIMATE.start_ssl3_connect_~s__state~0 4416)) (.cse12 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48)) (.cse7 (= ULTIMATE.start_ssl3_connect_~s__state~0 4384)) (.cse0 (not .cse8)) (.cse17 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse18 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse3 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse6 .cse7 .cse4 .cse8) (and .cse9 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10 .cse2 .cse11 .cse3 .cse4) (and .cse12 .cse2 .cse13 .cse6 .cse4 .cse8) (= ULTIMATE.start_ssl3_connect_~s__state~0 1) (and .cse1 .cse2 .cse6 .cse4 .cse8) (and .cse12 .cse2 .cse6 .cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0) .cse8) (and .cse14 .cse13 .cse6 .cse8) (and .cse0 .cse5 .cse2 .cse7 .cse4 .cse3) (and .cse15 .cse6 .cse8) (and .cse0 .cse14 .cse13 .cse3) (and .cse9 .cse12 .cse2 .cse11 .cse6 .cse4 .cse8) (and .cse0 .cse10 .cse2 .cse16 .cse4 .cse3) (and .cse17 .cse18 .cse10 .cse2 .cse6 .cse4 .cse8) (and .cse0 .cse15 .cse3) (and .cse10 .cse2 .cse6 .cse16 .cse4 .cse8) (and .cse12 .cse2 .cse6 .cse7 .cse4 .cse8) (and .cse0 .cse17 .cse18 .cse10 .cse2 .cse3 .cse4)))) [2021-01-06 11:32:50,867 INFO L189 CegarLoopUtils]: For program point L76(lines 76 84) no Hoare annotation was computed. [2021-01-06 11:32:50,867 INFO L192 CegarLoopUtils]: At program point L605(lines 100 606) the Hoare annotation is: true [2021-01-06 11:32:50,867 INFO L189 CegarLoopUtils]: For program point L176(lines 176 549) no Hoare annotation was computed. [2021-01-06 11:32:50,867 INFO L189 CegarLoopUtils]: For program point L143(lines 143 560) no Hoare annotation was computed. [2021-01-06 11:32:50,868 INFO L189 CegarLoopUtils]: For program point L110(lines 110 571) no Hoare annotation was computed. [2021-01-06 11:32:50,868 INFO L189 CegarLoopUtils]: For program point L375(lines 375 379) no Hoare annotation was computed. [2021-01-06 11:32:50,868 INFO L189 CegarLoopUtils]: For program point L375-2(lines 375 379) no Hoare annotation was computed. [2021-01-06 11:32:50,868 INFO L185 CegarLoopUtils]: At program point L210(lines 107 572) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (let ((.cse7 (not .cse4)) (.cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse9 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352)) (.cse6 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse8 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0)) (.cse1 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4)) .cse6) (and .cse5 .cse7 .cse8 .cse9) (and (or (and .cse7 .cse0 .cse2 .cse3) (and .cse5 .cse7 .cse0 .cse2)) .cse6 .cse9) (and (let ((.cse10 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse10 .cse1 .cse2 .cse4))) .cse6) (and .cse5 .cse8 .cse1 .cse4)))) [2021-01-06 11:32:50,868 INFO L185 CegarLoopUtils]: At program point L177(lines 173 550) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48) .cse4 .cse5) (and (not .cse5) .cse0 .cse1 .cse2 .cse3 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse4))) [2021-01-06 11:32:50,869 INFO L189 CegarLoopUtils]: For program point L574(lines 574 602) no Hoare annotation was computed. [2021-01-06 11:32:50,869 INFO L189 CegarLoopUtils]: For program point L79(lines 79 83) no Hoare annotation was computed. [2021-01-06 11:32:50,869 INFO L189 CegarLoopUtils]: For program point L79-2(lines 76 84) no Hoare annotation was computed. [2021-01-06 11:32:50,869 INFO L189 CegarLoopUtils]: For program point L575(lines 575 599) no Hoare annotation was computed. [2021-01-06 11:32:50,869 INFO L189 CegarLoopUtils]: For program point L509-1(lines 205 537) no Hoare annotation was computed. [2021-01-06 11:32:50,869 INFO L189 CegarLoopUtils]: For program point L344(lines 344 349) no Hoare annotation was computed. [2021-01-06 11:32:50,869 INFO L189 CegarLoopUtils]: For program point L278(lines 278 282) no Hoare annotation was computed. [2021-01-06 11:32:50,870 INFO L189 CegarLoopUtils]: For program point L311-1(lines 311 325) no Hoare annotation was computed. [2021-01-06 11:32:50,870 INFO L189 CegarLoopUtils]: For program point L179(lines 179 548) no Hoare annotation was computed. [2021-01-06 11:32:50,870 INFO L189 CegarLoopUtils]: For program point L146(lines 146 559) no Hoare annotation was computed. [2021-01-06 11:32:50,871 INFO L189 CegarLoopUtils]: For program point L113(lines 113 570) no Hoare annotation was computed. [2021-01-06 11:32:50,871 INFO L189 CegarLoopUtils]: For program point L609(lines 609 613) no Hoare annotation was computed. [2021-01-06 11:32:50,871 INFO L189 CegarLoopUtils]: For program point L576(lines 576 585) no Hoare annotation was computed. [2021-01-06 11:32:50,873 INFO L189 CegarLoopUtils]: For program point L609-2(lines 609 613) no Hoare annotation was computed. [2021-01-06 11:32:50,873 INFO L189 CegarLoopUtils]: For program point L576-2(lines 575 597) no Hoare annotation was computed. [2021-01-06 11:32:50,876 INFO L185 CegarLoopUtils]: At program point L147(lines 143 560) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48) .cse3 .cse4 .cse5) (and (not .cse5) .cse0 .cse1 .cse2 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse3 .cse4))) [2021-01-06 11:32:50,876 INFO L189 CegarLoopUtils]: For program point L578(lines 578 582) no Hoare annotation was computed. [2021-01-06 11:32:50,876 INFO L189 CegarLoopUtils]: For program point L446(lines 446 451) no Hoare annotation was computed. [2021-01-06 11:32:50,876 INFO L189 CegarLoopUtils]: For program point L215(lines 215 219) no Hoare annotation was computed. [2021-01-06 11:32:50,876 INFO L189 CegarLoopUtils]: For program point L182(lines 182 547) no Hoare annotation was computed. [2021-01-06 11:32:50,877 INFO L189 CegarLoopUtils]: For program point L149(lines 149 558) no Hoare annotation was computed. [2021-01-06 11:32:50,877 INFO L189 CegarLoopUtils]: For program point L215-2(lines 205 537) no Hoare annotation was computed. [2021-01-06 11:32:50,877 INFO L189 CegarLoopUtils]: For program point L116(lines 116 569) no Hoare annotation was computed. [2021-01-06 11:32:50,877 INFO L189 CegarLoopUtils]: For program point L480(lines 480 484) no Hoare annotation was computed. [2021-01-06 11:32:50,877 INFO L189 CegarLoopUtils]: For program point L315(lines 315 319) no Hoare annotation was computed. [2021-01-06 11:32:50,877 INFO L189 CegarLoopUtils]: For program point L315-2(lines 313 325) no Hoare annotation was computed. [2021-01-06 11:32:50,878 INFO L185 CegarLoopUtils]: At program point L183(lines 179 548) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48) .cse4 .cse5) (and (not .cse5) .cse0 .cse1 .cse2 .cse3 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse4))) [2021-01-06 11:32:50,878 INFO L189 CegarLoopUtils]: For program point L514-1(lines 514 518) no Hoare annotation was computed. [2021-01-06 11:32:50,878 INFO L189 CegarLoopUtils]: For program point L415(lines 415 419) no Hoare annotation was computed. [2021-01-06 11:32:50,878 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 11:32:50,878 INFO L189 CegarLoopUtils]: For program point L251(lines 251 256) no Hoare annotation was computed. [2021-01-06 11:32:50,878 INFO L189 CegarLoopUtils]: For program point L185(lines 185 546) no Hoare annotation was computed. [2021-01-06 11:32:50,878 INFO L189 CegarLoopUtils]: For program point L152(lines 152 557) no Hoare annotation was computed. [2021-01-06 11:32:50,879 INFO L189 CegarLoopUtils]: For program point L119(lines 119 568) no Hoare annotation was computed. [2021-01-06 11:32:50,879 INFO L189 CegarLoopUtils]: For program point L86(lines 86 94) no Hoare annotation was computed. [2021-01-06 11:32:50,880 INFO L189 CegarLoopUtils]: For program point L86-1(lines 68 622) no Hoare annotation was computed. [2021-01-06 11:32:50,880 INFO L185 CegarLoopUtils]: At program point L153(lines 149 558) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48) .cse4 .cse5) (and (not .cse5) .cse0 .cse2 .cse1 .cse3 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse4))) [2021-01-06 11:32:50,880 INFO L189 CegarLoopUtils]: For program point L87(lines 87 91) no Hoare annotation was computed. [2021-01-06 11:32:50,880 INFO L189 CegarLoopUtils]: For program point L485(lines 485 489) no Hoare annotation was computed. [2021-01-06 11:32:50,880 INFO L189 CegarLoopUtils]: For program point L485-2(lines 485 489) no Hoare annotation was computed. [2021-01-06 11:32:50,880 INFO L189 CegarLoopUtils]: For program point L287(lines 287 295) no Hoare annotation was computed. [2021-01-06 11:32:50,881 INFO L189 CegarLoopUtils]: For program point L188(lines 188 545) no Hoare annotation was computed. [2021-01-06 11:32:50,881 INFO L189 CegarLoopUtils]: For program point L155(lines 155 556) no Hoare annotation was computed. [2021-01-06 11:32:50,881 INFO L189 CegarLoopUtils]: For program point L122(lines 122 567) no Hoare annotation was computed. [2021-01-06 11:32:50,881 INFO L189 CegarLoopUtils]: For program point L387(lines 387 391) no Hoare annotation was computed. [2021-01-06 11:32:50,881 INFO L189 CegarLoopUtils]: For program point L354(lines 354 358) no Hoare annotation was computed. [2021-01-06 11:32:50,881 INFO L185 CegarLoopUtils]: At program point L189(lines 185 546) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48) .cse3 .cse4) (and (not .cse4) .cse0 .cse1 .cse2 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse3))) [2021-01-06 11:32:50,882 INFO L185 CegarLoopUtils]: At program point L123(lines 119 568) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (let ((.cse6 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0)) (.cse7 (not .cse5)) (.cse8 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352))) (or (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse7 .cse6 .cse0 .cse2 .cse8) (and .cse7 .cse9 .cse0 .cse1 .cse2 .cse4 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)))) [2021-01-06 11:32:50,882 INFO L185 CegarLoopUtils]: At program point L355(lines 68 622) the Hoare annotation is: false [2021-01-06 11:32:50,882 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 11:32:50,882 INFO L192 CegarLoopUtils]: At program point L620(lines 68 622) the Hoare annotation is: true [2021-01-06 11:32:50,882 INFO L189 CegarLoopUtils]: For program point L587(lines 587 593) no Hoare annotation was computed. [2021-01-06 11:32:50,882 INFO L189 CegarLoopUtils]: For program point L521(lines 521 525) no Hoare annotation was computed. [2021-01-06 11:32:50,882 INFO L189 CegarLoopUtils]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2021-01-06 11:32:50,882 INFO L189 CegarLoopUtils]: For program point L290(lines 290 294) no Hoare annotation was computed. [2021-01-06 11:32:50,883 INFO L189 CegarLoopUtils]: For program point L290-2(lines 205 537) no Hoare annotation was computed. [2021-01-06 11:32:50,883 INFO L189 CegarLoopUtils]: For program point L191(lines 191 544) no Hoare annotation was computed. [2021-01-06 11:32:50,883 INFO L189 CegarLoopUtils]: For program point L158(lines 158 555) no Hoare annotation was computed. [2021-01-06 11:32:50,883 INFO L189 CegarLoopUtils]: For program point L125(lines 125 566) no Hoare annotation was computed. [2021-01-06 11:32:50,883 INFO L192 CegarLoopUtils]: At program point L621(lines 10 623) the Hoare annotation is: true [2021-01-06 11:32:50,883 INFO L189 CegarLoopUtils]: For program point L456(lines 456 460) no Hoare annotation was computed. [2021-01-06 11:32:50,883 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 11:32:50,883 INFO L189 CegarLoopUtils]: For program point L359(lines 359 363) no Hoare annotation was computed. [2021-01-06 11:32:50,884 INFO L189 CegarLoopUtils]: For program point L227(lines 227 244) no Hoare annotation was computed. [2021-01-06 11:32:50,884 INFO L189 CegarLoopUtils]: For program point L194(lines 194 543) no Hoare annotation was computed. [2021-01-06 11:32:50,884 INFO L189 CegarLoopUtils]: For program point L161(lines 161 554) no Hoare annotation was computed. [2021-01-06 11:32:50,884 INFO L189 CegarLoopUtils]: For program point L227-2(lines 205 537) no Hoare annotation was computed. [2021-01-06 11:32:50,884 INFO L189 CegarLoopUtils]: For program point L128(lines 128 565) no Hoare annotation was computed. [2021-01-06 11:32:50,884 INFO L185 CegarLoopUtils]: At program point L195(lines 191 544) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48) .cse0) (and (not .cse0) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0) (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0) (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352) (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)))) [2021-01-06 11:32:50,885 INFO L185 CegarLoopUtils]: At program point L129(lines 125 566) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (let ((.cse0 (not .cse8)) (.cse6 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 1)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse4 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse7 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse1 .cse3 .cse4 .cse7 .cse5 .cse8) (and .cse0 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse3 .cse4 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse8)))) [2021-01-06 11:32:50,885 INFO L189 CegarLoopUtils]: For program point L493-1(lines 493 505) no Hoare annotation was computed. [2021-01-06 11:32:50,885 INFO L189 CegarLoopUtils]: For program point L427(lines 427 431) no Hoare annotation was computed. [2021-01-06 11:32:50,885 INFO L189 CegarLoopUtils]: For program point L229(lines 229 234) no Hoare annotation was computed. [2021-01-06 11:32:50,885 INFO L189 CegarLoopUtils]: For program point L197(lines 197 542) no Hoare annotation was computed. [2021-01-06 11:32:50,885 INFO L189 CegarLoopUtils]: For program point L164(lines 164 553) no Hoare annotation was computed. [2021-01-06 11:32:50,885 INFO L189 CegarLoopUtils]: For program point L131(lines 131 564) no Hoare annotation was computed. [2021-01-06 11:32:50,885 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 11:32:50,886 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 616) no Hoare annotation was computed. [2021-01-06 11:32:50,886 INFO L189 CegarLoopUtils]: For program point L528(lines 528 532) no Hoare annotation was computed. [2021-01-06 11:32:50,886 INFO L185 CegarLoopUtils]: At program point L198(lines 197 542) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (let ((.cse6 (not .cse5)) (.cse8 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse7 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse1 .cse2 .cse4 .cse8) (and .cse0 .cse6 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse4 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5)))) [2021-01-06 11:32:50,886 INFO L185 CegarLoopUtils]: At program point L165(lines 155 556) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~ag_X~0 4352))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_connect_~ag_Z~0 48) .cse3 .cse4 .cse5) (and (not .cse5) .cse0 .cse1 .cse2 .cse3 (<= 208 ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse4))) [2021-01-06 11:32:50,886 INFO L189 CegarLoopUtils]: For program point L496(lines 496 501) no Hoare annotation was computed. [2021-01-06 11:32:50,887 INFO L189 CegarLoopUtils]: For program point L463(lines 463 474) no Hoare annotation was computed. [2021-01-06 11:32:50,887 INFO L189 CegarLoopUtils]: For program point L463-1(lines 463 474) no Hoare annotation was computed. [2021-01-06 11:32:50,887 INFO L189 CegarLoopUtils]: For program point L265(lines 265 269) no Hoare annotation was computed. [2021-01-06 11:32:50,887 INFO L189 CegarLoopUtils]: For program point L265-2(lines 205 537) no Hoare annotation was computed. [2021-01-06 11:32:50,887 INFO L189 CegarLoopUtils]: For program point L398(lines 398 402) no Hoare annotation was computed. [2021-01-06 11:32:50,887 INFO L189 CegarLoopUtils]: For program point L332(lines 332 336) no Hoare annotation was computed. [2021-01-06 11:32:50,887 INFO L189 CegarLoopUtils]: For program point L332-2(lines 205 537) no Hoare annotation was computed. [2021-01-06 11:32:50,887 INFO L189 CegarLoopUtils]: For program point L200(lines 200 541) no Hoare annotation was computed. [2021-01-06 11:32:50,887 INFO L189 CegarLoopUtils]: For program point L167(lines 167 552) no Hoare annotation was computed. [2021-01-06 11:32:50,888 INFO L189 CegarLoopUtils]: For program point L134(lines 134 563) no Hoare annotation was computed. [2021-01-06 11:32:50,888 INFO L189 CegarLoopUtils]: For program point L101-1(lines 68 622) no Hoare annotation was computed. [2021-01-06 11:32:50,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:32:50 BoogieIcfgContainer [2021-01-06 11:32:50,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:32:50,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:32:50,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:32:50,950 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:32:50,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:32:32" (3/4) ... [2021-01-06 11:32:50,955 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 11:32:50,987 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-01-06 11:32:50,989 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 11:32:50,990 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:32:50,991 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:32:51,101 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/bitvector/s3_clnt_3.BV.c.cil-1a.c-witness.graphml [2021-01-06 11:32:51,102 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:32:51,106 INFO L168 Benchmark]: Toolchain (without parser) took 20360.54 ms. Allocated memory was 151.0 MB in the beginning and 809.5 MB in the end (delta: 658.5 MB). Free memory was 127.2 MB in the beginning and 573.2 MB in the end (delta: -446.0 MB). Peak memory consumption was 212.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:32:51,106 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 151.0 MB. Free memory is still 132.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:32:51,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.22 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 111.7 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:32:51,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.45 ms. Allocated memory is still 151.0 MB. Free memory was 111.7 MB in the beginning and 108.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:32:51,110 INFO L168 Benchmark]: Boogie Preprocessor took 95.27 ms. Allocated memory is still 151.0 MB. Free memory was 108.7 MB in the beginning and 106.6 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:32:51,110 INFO L168 Benchmark]: RCFGBuilder took 1054.32 ms. Allocated memory is still 151.0 MB. Free memory was 106.6 MB in the beginning and 88.3 MB in the end (delta: 18.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-01-06 11:32:51,110 INFO L168 Benchmark]: TraceAbstraction took 18386.52 ms. Allocated memory was 151.0 MB in the beginning and 809.5 MB in the end (delta: 658.5 MB). Free memory was 87.8 MB in the beginning and 583.7 MB in the end (delta: -495.9 MB). Peak memory consumption was 319.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:32:51,111 INFO L168 Benchmark]: Witness Printer took 152.27 ms. Allocated memory is still 809.5 MB. Free memory was 583.2 MB in the beginning and 573.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:32:51,116 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 151.0 MB. Free memory is still 132.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 540.22 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 111.7 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 118.45 ms. Allocated memory is still 151.0 MB. Free memory was 111.7 MB in the beginning and 108.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 95.27 ms. Allocated memory is still 151.0 MB. Free memory was 108.7 MB in the beginning and 106.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1054.32 ms. Allocated memory is still 151.0 MB. Free memory was 106.6 MB in the beginning and 88.3 MB in the end (delta: 18.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18386.52 ms. Allocated memory was 151.0 MB in the beginning and 809.5 MB in the end (delta: 658.5 MB). Free memory was 87.8 MB in the beginning and 583.7 MB in the end (delta: -495.9 MB). Peak memory consumption was 319.9 MB. Max. memory is 8.0 GB. * Witness Printer took 152.27 ms. Allocated memory is still 809.5 MB. Free memory was 583.2 MB in the beginning and 573.2 MB in the end (delta: 10.0 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: 616]: 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: 155]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && blastFlag <= 4) && 4352 <= ag_X) && ag_Z == 48) && s__state <= 4480) && ag_X <= 4352) && s__hit == 0) || ((((((!(s__hit == 0) && 4432 <= s__state) && blastFlag <= 4) && 4352 <= ag_X) && s__state <= 4480) && 208 <= ag_Y) && ag_X <= 4352) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((4560 <= s__s3__tmp__next_state___0 && s__state <= 4432) && 4352 <= ag_X) && 4352 <= s__state) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0) || ((((blastFlag == 0 && s__state <= 4432) && 4352 <= s__state) && ag_Z == 48) && s__hit == 0)) || ((((!(s__hit == 0) && blastFlag == 0) && s__state <= 4432) && 4352 <= s__state) && 208 <= ag_Y)) || ((((((!(s__hit == 0) && blastFlag == 2) && s__state <= 4432) && 4352 <= ag_X) && 4352 <= s__state) && ag_X <= 4352) && 208 <= ag_Y)) || ((((((blastFlag == 2 && s__state <= 4432) && 4352 <= ag_X) && 4352 <= s__state) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((s__state <= 4352 && 4560 <= s__s3__tmp__next_state___0) && 4352 <= ag_X) && 4352 <= s__state) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0) || ((((((s__state <= 4352 && !(s__hit == 0)) && blastFlag == 2) && 4352 <= ag_X) && 4352 <= s__state) && ag_X <= 4352) && 208 <= ag_Y)) || (((((((s__state <= 4352 && !(s__hit == 0)) && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= ag_X) && 4352 <= s__state) && ag_X <= 4352) && 208 <= ag_Y)) || ((((((s__state <= 4352 && blastFlag == 2) && 4352 <= ag_X) && 4352 <= s__state) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && blastFlag <= 4) && 4352 <= ag_X) && s__state <= 4512) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0) || ((((((!(s__hit == 0) && 4432 <= s__state) && blastFlag <= 4) && 4352 <= ag_X) && s__state <= 4512) && 208 <= ag_Y) && ag_X <= 4352) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((!(s__hit == 0) && blastFlag == 2) && s__state <= 4432) && 4352 <= ag_X) && 4352 <= s__state) && ag_X <= 4352) && 208 <= ag_Y) || ((((((blastFlag == 2 && s__state <= 4432) && 4352 <= ag_X) && 4352 <= s__state) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((((((((blastFlag == 2 && ag_Z == 48) && ag_X <= 4352) && 4560 <= s__state) && s__hit == 0) || ((((s__state <= 4352 && blastFlag == 2) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0)) && 4352 <= ag_X) || (((s__state <= 4352 && !(s__hit == 0)) && blastFlag == 0) && 208 <= ag_Y)) || ((((((!(s__hit == 0) && blastFlag == 2) && ag_X <= 4352) && 4560 <= s__state) || (((s__state <= 4352 && !(s__hit == 0)) && blastFlag == 2) && ag_X <= 4352)) && 4352 <= ag_X) && 208 <= ag_Y)) || ((((((4560 <= s__s3__tmp__next_state___0 && ag_Z == 48) && ag_X <= 4352) && 4560 <= s__state) && s__hit == 0) || ((((s__state <= 4352 && 4560 <= s__s3__tmp__next_state___0) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0)) && 4352 <= ag_X)) || (((s__state <= 4352 && blastFlag == 0) && ag_Z == 48) && s__hit == 0) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && blastFlag <= 4) && 4352 <= ag_X) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0) || (((((!(s__hit == 0) && 4432 <= s__state) && blastFlag <= 4) && 4352 <= ag_X) && 208 <= ag_Y) && ag_X <= 4352) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && blastFlag <= 4) && 4352 <= ag_X) && ag_Z == 48) && ag_X <= 4352) && s__state <= 4448) && s__hit == 0) || ((((((!(s__hit == 0) && 4432 <= s__state) && blastFlag <= 4) && 4352 <= ag_X) && 208 <= ag_Y) && ag_X <= 4352) && s__state <= 4448) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((4560 <= s__s3__tmp__next_state___0 && 4352 <= ag_X) && ag_Z == 48) && ag_X <= 4352) && 12292 == s__state) && s__hit == 0) || (((((!(s__hit == 0) && blastFlag == 2) && 4352 <= ag_X) && 208 <= ag_Y) && ag_X <= 4352) && 12292 == s__state)) || (((blastFlag == 0 && ag_Z == 48) && 12292 == s__state) && s__hit == 0)) || (((!(s__hit == 0) && blastFlag == 0) && 208 <= ag_Y) && 12292 == s__state)) || (((((blastFlag == 2 && 4352 <= ag_X) && ag_Z == 48) && ag_X <= 4352) && 12292 == s__state) && s__hit == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((!(s__hit == 0) && 4432 <= s__state) && blastFlag <= 4) && 4352 <= ag_X) && s__state <= 4512) && 208 <= ag_Y) && ag_X <= 4352) || ((((((4432 <= s__state && blastFlag <= 4) && 4352 <= ag_X) && ag_Z == 48) && s__state <= 4512) && ag_X <= 4352) && s__hit == 0) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((!(s__hit == 0) && s__state <= 4432) && blastFlag == 1) && 4352 <= ag_X) && 4352 <= s__state) && ag_X <= 4352) && 208 <= ag_Y) || ((((((4560 <= s__s3__tmp__next_state___0 && s__state <= 4432) && 4352 <= ag_X) && 4352 <= s__state) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0)) || ((((((!(s__hit == 0) && blastFlag == 2) && s__state <= 4432) && 4352 <= ag_X) && 4352 <= s__state) && ag_X <= 4352) && 208 <= ag_Y)) || ((((((blastFlag == 2 && s__state <= 4432) && 4352 <= ag_X) && 4352 <= s__state) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0)) || ((((((s__state <= 4432 && blastFlag == 1) && 4352 <= ag_X) && 4352 <= s__state) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((s__state <= 4528 && 4432 <= s__state) && blastFlag <= 4) && 4352 <= ag_X) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0) || ((((((!(s__hit == 0) && s__state <= 4528) && 4432 <= s__state) && blastFlag <= 4) && 4352 <= ag_X) && 208 <= ag_Y) && ag_X <= 4352) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 4 && s__state <= 4432) && 4352 <= ag_X) && 4352 <= s__state) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0) || ((((((!(s__hit == 0) && blastFlag <= 4) && s__state <= 4432) && 4352 <= ag_X) && 4352 <= s__state) && 208 <= ag_Y) && ag_X <= 4352) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((4432 <= s__state && ag_Z == 48) && s__hit == 0) || (((((!(s__hit == 0) && blastFlag == 2) && 4352 <= ag_X) && 208 <= ag_Y) && ag_X <= 4352) && 4560 <= s__state) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(s__hit == 0) && blastFlag == 2) && 4352 <= ag_X) && 208 <= ag_Y) && ag_X <= 4352) || (((((blastFlag == 1 && 4352 <= ag_X) && ag_Z == 48) && s__state == 4384) && ag_X <= 4352) && s__hit == 0)) || (((((((s__state <= 4352 && !(s__hit == 0)) && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= ag_X) && 4352 <= s__state) && 208 <= ag_Y) && ag_X <= 4352)) || (((((4560 <= s__s3__tmp__next_state___0 && 4352 <= ag_X) && s__state == 4368) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0)) || s__state == 1) || ((((blastFlag == 2 && 4352 <= ag_X) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0)) || (((((4560 <= s__s3__tmp__next_state___0 && 4352 <= ag_X) && ag_Z == 48) && ag_X <= 4352) && 4560 <= s__state) && s__hit == 0)) || (((blastFlag == 0 && s__state == 4368) && ag_Z == 48) && s__hit == 0)) || (((((!(s__hit == 0) && blastFlag == 1) && 4352 <= ag_X) && s__state == 4384) && ag_X <= 4352) && 208 <= ag_Y)) || ((s__state <= 3 && ag_Z == 48) && s__hit == 0)) || (((!(s__hit == 0) && blastFlag == 0) && s__state == 4368) && 208 <= ag_Y)) || ((((((s__state <= 4352 && 4560 <= s__s3__tmp__next_state___0) && 4352 <= ag_X) && 4352 <= s__state) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0)) || (((((!(s__hit == 0) && blastFlag <= 4) && 4352 <= ag_X) && s__state == 4416) && ag_X <= 4352) && 208 <= ag_Y)) || ((((((s__state <= 4528 && 4432 <= s__state) && blastFlag <= 4) && 4352 <= ag_X) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0)) || ((!(s__hit == 0) && s__state <= 3) && 208 <= ag_Y)) || (((((blastFlag <= 4 && 4352 <= ag_X) && ag_Z == 48) && s__state == 4416) && ag_X <= 4352) && s__hit == 0)) || (((((4560 <= s__s3__tmp__next_state___0 && 4352 <= ag_X) && ag_Z == 48) && s__state == 4384) && ag_X <= 4352) && s__hit == 0)) || ((((((!(s__hit == 0) && s__state <= 4528) && 4432 <= s__state) && blastFlag <= 4) && 4352 <= ag_X) && 208 <= ag_Y) && ag_X <= 4352) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__state <= 4464) && blastFlag <= 4) && 4352 <= ag_X) && ag_Z == 48) && ag_X <= 4352) && s__hit == 0) || ((((((!(s__hit == 0) && 4432 <= s__state) && blastFlag <= 4) && s__state <= 4464) && 4352 <= ag_X) && 208 <= ag_Y) && ag_X <= 4352) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 134 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.5s, OverallIterations: 27, TraceHistogramMax: 15, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5464 SDtfs, 2882 SDslu, 3688 SDs, 0 SdLazy, 2886 SolverSat, 658 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1465 GetRequests, 1418 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2631occurred 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.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 1516 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 173 NumberOfFragments, 1291 HoareAnnotationTreeSize, 23 FomulaSimplifications, 134312 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 23 FomulaSimplificationsInter, 29330 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 5859 NumberOfCodeBlocks, 5859 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 5828 ConstructedInterpolants, 0 QuantifiedInterpolants, 1937022 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2650 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 16891/16956 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...