/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:35:40,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:35:40,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:35:40,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:35:40,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:35:40,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:35:40,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:35:40,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:35:40,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:35:40,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:35:40,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:35:40,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:35:40,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:35:40,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:35:40,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:35:40,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:35:40,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:35:40,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:35:41,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:35:41,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:35:41,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:35:41,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:35:41,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:35:41,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:35:41,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:35:41,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:35:41,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:35:41,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:35:41,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:35:41,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:35:41,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:35:41,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:35:41,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:35:41,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:35:41,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:35:41,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:35:41,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:35:41,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:35:41,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:35:41,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:35:41,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:35:41,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:35:41,052 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:35:41,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:35:41,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:35:41,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:35:41,054 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:35:41,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:35:41,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:35:41,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:35:41,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:35:41,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:35:41,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:35:41,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:35:41,056 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:35:41,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:35:41,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:35:41,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:35:41,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:35:41,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:35:41,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:35:41,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:35:41,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:35:41,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:35:41,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:35:41,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:35:41,058 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:35:41,058 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 11:35:41,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:35:41,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:35:41,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:35:41,470 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:35:41,471 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:35:41,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c [2021-01-06 11:35:41,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7afc41ab5/65be3f30a41342a681551723af620002/FLAGd835ce6b5 [2021-01-06 11:35:42,240 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:35:42,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c [2021-01-06 11:35:42,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7afc41ab5/65be3f30a41342a681551723af620002/FLAGd835ce6b5 [2021-01-06 11:35:42,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7afc41ab5/65be3f30a41342a681551723af620002 [2021-01-06 11:35:42,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:35:42,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:35:42,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:42,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:35:42,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:35:42,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:42" (1/1) ... [2021-01-06 11:35:42,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec98dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:42, skipping insertion in model container [2021-01-06 11:35:42,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:42" (1/1) ... [2021-01-06 11:35:42,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:35:42,646 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[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~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__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:35:42,891 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c[42372,42385] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2021-01-06 11:35:42,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:42,927 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[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~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__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:35:43,076 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c[42372,42385] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2021-01-06 11:35:43,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:43,116 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:35:43,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43 WrapperNode [2021-01-06 11:35:43,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:43,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:43,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:35:43,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:35:43,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:43,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:35:43,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:35:43,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:35:43,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:35:43,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:35:43,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:35:43,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:35:43,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:35:43,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:35:43,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:35:43,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:35:43,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:35:43,791 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:35:44,471 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-01-06 11:35:44,471 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-01-06 11:35:44,482 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:35:44,482 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:35:44,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:44 BoogieIcfgContainer [2021-01-06 11:35:44,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:35:44,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:35:44,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:35:44,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:35:44,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:35:42" (1/3) ... [2021-01-06 11:35:44,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e8940a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:44, skipping insertion in model container [2021-01-06 11:35:44,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (2/3) ... [2021-01-06 11:35:44,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e8940a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:44, skipping insertion in model container [2021-01-06 11:35:44,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:44" (3/3) ... [2021-01-06 11:35:44,493 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2021-01-06 11:35:44,500 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:35:44,505 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:35:44,525 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:35:44,554 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:35:44,555 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:35:44,555 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:35:44,555 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:35:44,555 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:35:44,555 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:35:44,555 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:35:44,556 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:35:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2021-01-06 11:35:44,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:35:44,586 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:44,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:44,587 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:44,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2021-01-06 11:35:44,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:44,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540621743] [2021-01-06 11:35:44,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:44,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540621743] [2021-01-06 11:35:44,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:44,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:44,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986659141] [2021-01-06 11:35:44,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:44,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:44,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:44,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:44,936 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2021-01-06 11:35:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:45,271 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2021-01-06 11:35:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:45,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 11:35:45,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:45,307 INFO L225 Difference]: With dead ends: 328 [2021-01-06 11:35:45,307 INFO L226 Difference]: Without dead ends: 175 [2021-01-06 11:35:45,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-01-06 11:35:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2021-01-06 11:35:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2021-01-06 11:35:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2021-01-06 11:35:45,439 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2021-01-06 11:35:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:45,440 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2021-01-06 11:35:45,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2021-01-06 11:35:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:35:45,443 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:45,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:45,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:35:45,444 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:45,445 INFO L82 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2021-01-06 11:35:45,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:45,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816798799] [2021-01-06 11:35:45,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:45,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816798799] [2021-01-06 11:35:45,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:45,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:45,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651193493] [2021-01-06 11:35:45,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:45,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:45,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:45,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:45,592 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand 3 states. [2021-01-06 11:35:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:45,842 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2021-01-06 11:35:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:45,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2021-01-06 11:35:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:45,847 INFO L225 Difference]: With dead ends: 380 [2021-01-06 11:35:45,847 INFO L226 Difference]: Without dead ends: 216 [2021-01-06 11:35:45,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:45,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-01-06 11:35:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2021-01-06 11:35:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2021-01-06 11:35:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2021-01-06 11:35:45,884 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2021-01-06 11:35:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:45,884 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2021-01-06 11:35:45,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2021-01-06 11:35:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 11:35:45,889 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:45,891 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:45,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:35:45,892 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:45,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2071968837, now seen corresponding path program 1 times [2021-01-06 11:35:45,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:45,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364124046] [2021-01-06 11:35:45,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:45,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364124046] [2021-01-06 11:35:45,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:45,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:45,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525245156] [2021-01-06 11:35:45,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:45,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:45,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:45,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:45,988 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand 3 states. [2021-01-06 11:35:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:46,162 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2021-01-06 11:35:46,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:46,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 11:35:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:46,166 INFO L225 Difference]: With dead ends: 445 [2021-01-06 11:35:46,166 INFO L226 Difference]: Without dead ends: 242 [2021-01-06 11:35:46,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-01-06 11:35:46,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-01-06 11:35:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 11:35:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2021-01-06 11:35:46,202 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2021-01-06 11:35:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:46,203 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2021-01-06 11:35:46,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2021-01-06 11:35:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:35:46,209 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:46,210 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:46,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:35:46,210 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:46,211 INFO L82 PathProgramCache]: Analyzing trace with hash -947039589, now seen corresponding path program 1 times [2021-01-06 11:35:46,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:46,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328383157] [2021-01-06 11:35:46,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:46,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328383157] [2021-01-06 11:35:46,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:46,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:46,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422741320] [2021-01-06 11:35:46,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:46,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:46,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:46,338 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand 3 states. [2021-01-06 11:35:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:46,515 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2021-01-06 11:35:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:46,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2021-01-06 11:35:46,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:46,519 INFO L225 Difference]: With dead ends: 493 [2021-01-06 11:35:46,519 INFO L226 Difference]: Without dead ends: 259 [2021-01-06 11:35:46,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-06 11:35:46,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2021-01-06 11:35:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2021-01-06 11:35:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2021-01-06 11:35:46,549 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2021-01-06 11:35:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:46,550 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2021-01-06 11:35:46,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2021-01-06 11:35:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:35:46,555 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:46,557 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:46,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:35:46,557 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1168944985, now seen corresponding path program 1 times [2021-01-06 11:35:46,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:46,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225073653] [2021-01-06 11:35:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:46,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225073653] [2021-01-06 11:35:46,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:46,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:46,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142247959] [2021-01-06 11:35:46,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:46,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:46,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:46,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:46,635 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand 3 states. [2021-01-06 11:35:46,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:46,861 INFO L93 Difference]: Finished difference Result 552 states and 931 transitions. [2021-01-06 11:35:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:46,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2021-01-06 11:35:46,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:46,864 INFO L225 Difference]: With dead ends: 552 [2021-01-06 11:35:46,864 INFO L226 Difference]: Without dead ends: 303 [2021-01-06 11:35:46,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-01-06 11:35:46,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-01-06 11:35:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-06 11:35:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2021-01-06 11:35:46,880 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2021-01-06 11:35:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:46,880 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2021-01-06 11:35:46,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2021-01-06 11:35:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:35:46,882 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:46,883 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:46,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:35:46,883 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:46,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2129818626, now seen corresponding path program 1 times [2021-01-06 11:35:46,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:46,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193469668] [2021-01-06 11:35:46,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:46,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193469668] [2021-01-06 11:35:46,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:46,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:46,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416156513] [2021-01-06 11:35:46,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:46,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:46,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:46,936 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand 3 states. [2021-01-06 11:35:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:47,102 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2021-01-06 11:35:47,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:47,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:35:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:47,105 INFO L225 Difference]: With dead ends: 592 [2021-01-06 11:35:47,105 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:35:47,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:35:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-01-06 11:35:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-06 11:35:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2021-01-06 11:35:47,119 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2021-01-06 11:35:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:47,119 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2021-01-06 11:35:47,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2021-01-06 11:35:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:35:47,121 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:47,121 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:47,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:35:47,122 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:47,122 INFO L82 PathProgramCache]: Analyzing trace with hash -122958423, now seen corresponding path program 1 times [2021-01-06 11:35:47,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:47,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526427085] [2021-01-06 11:35:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:47,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526427085] [2021-01-06 11:35:47,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:47,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:47,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274700458] [2021-01-06 11:35:47,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:47,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:47,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:47,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:47,203 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand 3 states. [2021-01-06 11:35:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:47,424 INFO L93 Difference]: Finished difference Result 594 states and 995 transitions. [2021-01-06 11:35:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:47,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:35:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:47,427 INFO L225 Difference]: With dead ends: 594 [2021-01-06 11:35:47,427 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:35:47,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:35:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2021-01-06 11:35:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2021-01-06 11:35:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2021-01-06 11:35:47,441 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2021-01-06 11:35:47,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:47,442 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2021-01-06 11:35:47,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2021-01-06 11:35:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:35:47,443 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:47,444 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:47,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:35:47,444 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1553184093, now seen corresponding path program 1 times [2021-01-06 11:35:47,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:47,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038081261] [2021-01-06 11:35:47,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-01-06 11:35:47,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038081261] [2021-01-06 11:35:47,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:47,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:47,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329404439] [2021-01-06 11:35:47,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:47,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:47,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:47,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:47,506 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand 3 states. [2021-01-06 11:35:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:47,646 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-01-06 11:35:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:47,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-06 11:35:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:47,649 INFO L225 Difference]: With dead ends: 595 [2021-01-06 11:35:47,650 INFO L226 Difference]: Without dead ends: 306 [2021-01-06 11:35:47,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-01-06 11:35:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-01-06 11:35:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2021-01-06 11:35:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2021-01-06 11:35:47,666 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2021-01-06 11:35:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:47,669 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2021-01-06 11:35:47,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2021-01-06 11:35:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:35:47,671 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:47,671 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:47,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:35:47,671 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:47,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:47,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2083521026, now seen corresponding path program 1 times [2021-01-06 11:35:47,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:47,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247877395] [2021-01-06 11:35:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:47,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247877395] [2021-01-06 11:35:47,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:47,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:47,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010821365] [2021-01-06 11:35:47,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:47,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:47,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:47,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:47,780 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 3 states. [2021-01-06 11:35:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:47,984 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2021-01-06 11:35:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:47,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 11:35:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:47,989 INFO L225 Difference]: With dead ends: 635 [2021-01-06 11:35:47,989 INFO L226 Difference]: Without dead ends: 337 [2021-01-06 11:35:47,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-01-06 11:35:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-01-06 11:35:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2021-01-06 11:35:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2021-01-06 11:35:48,010 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2021-01-06 11:35:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:48,010 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2021-01-06 11:35:48,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2021-01-06 11:35:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:35:48,012 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:48,012 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:48,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:35:48,012 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:48,013 INFO L82 PathProgramCache]: Analyzing trace with hash -102460539, now seen corresponding path program 1 times [2021-01-06 11:35:48,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:48,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351815742] [2021-01-06 11:35:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:48,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351815742] [2021-01-06 11:35:48,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:48,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:48,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29420847] [2021-01-06 11:35:48,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:48,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:48,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:48,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:48,088 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand 3 states. [2021-01-06 11:35:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:48,283 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2021-01-06 11:35:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:48,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 11:35:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:48,286 INFO L225 Difference]: With dead ends: 664 [2021-01-06 11:35:48,286 INFO L226 Difference]: Without dead ends: 337 [2021-01-06 11:35:48,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-01-06 11:35:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-01-06 11:35:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2021-01-06 11:35:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2021-01-06 11:35:48,302 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2021-01-06 11:35:48,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:48,303 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2021-01-06 11:35:48,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2021-01-06 11:35:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:35:48,305 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:48,305 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:48,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:35:48,305 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash -651386898, now seen corresponding path program 1 times [2021-01-06 11:35:48,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:48,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323909667] [2021-01-06 11:35:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:48,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323909667] [2021-01-06 11:35:48,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:48,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:48,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451607230] [2021-01-06 11:35:48,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:48,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:48,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:48,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:48,364 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand 3 states. [2021-01-06 11:35:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:48,535 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2021-01-06 11:35:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:48,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 11:35:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:48,538 INFO L225 Difference]: With dead ends: 697 [2021-01-06 11:35:48,539 INFO L226 Difference]: Without dead ends: 370 [2021-01-06 11:35:48,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-01-06 11:35:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-01-06 11:35:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2021-01-06 11:35:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2021-01-06 11:35:48,555 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2021-01-06 11:35:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:48,556 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2021-01-06 11:35:48,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2021-01-06 11:35:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 11:35:48,558 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:48,558 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:48,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:35:48,558 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1258189035, now seen corresponding path program 1 times [2021-01-06 11:35:48,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:48,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63895725] [2021-01-06 11:35:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:48,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63895725] [2021-01-06 11:35:48,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:48,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:48,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498040012] [2021-01-06 11:35:48,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:48,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:48,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:48,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:48,648 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand 3 states. [2021-01-06 11:35:48,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:48,844 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2021-01-06 11:35:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:48,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2021-01-06 11:35:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:48,848 INFO L225 Difference]: With dead ends: 724 [2021-01-06 11:35:48,848 INFO L226 Difference]: Without dead ends: 370 [2021-01-06 11:35:48,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-01-06 11:35:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-01-06 11:35:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2021-01-06 11:35:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2021-01-06 11:35:48,876 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2021-01-06 11:35:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:48,876 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2021-01-06 11:35:48,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:48,876 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2021-01-06 11:35:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 11:35:48,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:48,879 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:48,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:35:48,879 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:48,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1027805126, now seen corresponding path program 1 times [2021-01-06 11:35:48,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:48,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26826508] [2021-01-06 11:35:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:35:48,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26826508] [2021-01-06 11:35:48,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:48,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:48,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093559344] [2021-01-06 11:35:48,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:48,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:48,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:48,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:48,949 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand 3 states. [2021-01-06 11:35:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:49,124 INFO L93 Difference]: Finished difference Result 742 states and 1195 transitions. [2021-01-06 11:35:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:49,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 11:35:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:49,127 INFO L225 Difference]: With dead ends: 742 [2021-01-06 11:35:49,127 INFO L226 Difference]: Without dead ends: 388 [2021-01-06 11:35:49,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-01-06 11:35:49,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2021-01-06 11:35:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-01-06 11:35:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2021-01-06 11:35:49,154 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2021-01-06 11:35:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:49,156 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2021-01-06 11:35:49,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2021-01-06 11:35:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:35:49,158 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:49,158 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:49,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:35:49,159 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:49,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:49,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1570072403, now seen corresponding path program 1 times [2021-01-06 11:35:49,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:49,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482856712] [2021-01-06 11:35:49,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:35:49,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482856712] [2021-01-06 11:35:49,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:49,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:49,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325699267] [2021-01-06 11:35:49,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:49,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:49,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:49,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:49,213 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand 3 states. [2021-01-06 11:35:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:49,387 INFO L93 Difference]: Finished difference Result 763 states and 1218 transitions. [2021-01-06 11:35:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:49,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:35:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:49,390 INFO L225 Difference]: With dead ends: 763 [2021-01-06 11:35:49,391 INFO L226 Difference]: Without dead ends: 388 [2021-01-06 11:35:49,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-01-06 11:35:49,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2021-01-06 11:35:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-01-06 11:35:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2021-01-06 11:35:49,410 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2021-01-06 11:35:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:49,411 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2021-01-06 11:35:49,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2021-01-06 11:35:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:35:49,413 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:49,413 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:49,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:35:49,413 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1383340250, now seen corresponding path program 1 times [2021-01-06 11:35:49,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:49,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116607858] [2021-01-06 11:35:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-01-06 11:35:49,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116607858] [2021-01-06 11:35:49,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:49,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:49,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90914555] [2021-01-06 11:35:49,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:49,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:49,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:49,502 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand 3 states. [2021-01-06 11:35:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:49,554 INFO L93 Difference]: Finished difference Result 758 states and 1198 transitions. [2021-01-06 11:35:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:49,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 11:35:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:49,559 INFO L225 Difference]: With dead ends: 758 [2021-01-06 11:35:49,559 INFO L226 Difference]: Without dead ends: 756 [2021-01-06 11:35:49,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:49,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-01-06 11:35:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2021-01-06 11:35:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2021-01-06 11:35:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1196 transitions. [2021-01-06 11:35:49,595 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1196 transitions. Word has length 121 [2021-01-06 11:35:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:49,595 INFO L481 AbstractCegarLoop]: Abstraction has 756 states and 1196 transitions. [2021-01-06 11:35:49,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1196 transitions. [2021-01-06 11:35:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:35:49,598 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:49,599 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:49,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:35:49,599 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:49,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:49,600 INFO L82 PathProgramCache]: Analyzing trace with hash 56372730, now seen corresponding path program 1 times [2021-01-06 11:35:49,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:49,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016353112] [2021-01-06 11:35:49,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:35:49,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016353112] [2021-01-06 11:35:49,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:49,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:49,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689369430] [2021-01-06 11:35:49,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:49,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:49,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:49,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:49,662 INFO L87 Difference]: Start difference. First operand 756 states and 1196 transitions. Second operand 3 states. [2021-01-06 11:35:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:49,723 INFO L93 Difference]: Finished difference Result 1872 states and 2964 transitions. [2021-01-06 11:35:49,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:49,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:35:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:49,729 INFO L225 Difference]: With dead ends: 1872 [2021-01-06 11:35:49,729 INFO L226 Difference]: Without dead ends: 1124 [2021-01-06 11:35:49,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:49,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-01-06 11:35:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1124. [2021-01-06 11:35:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2021-01-06 11:35:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1777 transitions. [2021-01-06 11:35:49,779 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1777 transitions. Word has length 122 [2021-01-06 11:35:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:49,779 INFO L481 AbstractCegarLoop]: Abstraction has 1124 states and 1777 transitions. [2021-01-06 11:35:49,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1777 transitions. [2021-01-06 11:35:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:35:49,783 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:49,783 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:49,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:35:49,783 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:49,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:49,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1445666744, now seen corresponding path program 1 times [2021-01-06 11:35:49,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:49,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149245318] [2021-01-06 11:35:49,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-01-06 11:35:49,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149245318] [2021-01-06 11:35:49,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:49,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:49,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813242361] [2021-01-06 11:35:49,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:49,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:49,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:49,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:49,826 INFO L87 Difference]: Start difference. First operand 1124 states and 1777 transitions. Second operand 3 states. [2021-01-06 11:35:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:49,906 INFO L93 Difference]: Finished difference Result 2591 states and 4097 transitions. [2021-01-06 11:35:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:49,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:35:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:49,915 INFO L225 Difference]: With dead ends: 2591 [2021-01-06 11:35:49,915 INFO L226 Difference]: Without dead ends: 1475 [2021-01-06 11:35:49,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2021-01-06 11:35:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2021-01-06 11:35:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2021-01-06 11:35:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2328 transitions. [2021-01-06 11:35:50,037 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2328 transitions. Word has length 122 [2021-01-06 11:35:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:50,038 INFO L481 AbstractCegarLoop]: Abstraction has 1475 states and 2328 transitions. [2021-01-06 11:35:50,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2328 transitions. [2021-01-06 11:35:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 11:35:50,046 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:50,046 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 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] [2021-01-06 11:35:50,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:35:50,047 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:50,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:50,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1566103125, now seen corresponding path program 1 times [2021-01-06 11:35:50,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:50,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705575842] [2021-01-06 11:35:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 11:35:50,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705575842] [2021-01-06 11:35:50,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:50,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:50,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856025541] [2021-01-06 11:35:50,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:50,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:50,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:50,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:50,137 INFO L87 Difference]: Start difference. First operand 1475 states and 2328 transitions. Second operand 3 states. [2021-01-06 11:35:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:50,437 INFO L93 Difference]: Finished difference Result 2982 states and 4692 transitions. [2021-01-06 11:35:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:50,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2021-01-06 11:35:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:50,448 INFO L225 Difference]: With dead ends: 2982 [2021-01-06 11:35:50,448 INFO L226 Difference]: Without dead ends: 1515 [2021-01-06 11:35:50,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2021-01-06 11:35:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1475. [2021-01-06 11:35:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2021-01-06 11:35:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2184 transitions. [2021-01-06 11:35:50,516 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2184 transitions. Word has length 159 [2021-01-06 11:35:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:50,516 INFO L481 AbstractCegarLoop]: Abstraction has 1475 states and 2184 transitions. [2021-01-06 11:35:50,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2184 transitions. [2021-01-06 11:35:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 11:35:50,521 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:50,521 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:50,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:35:50,521 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:50,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:50,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1636228969, now seen corresponding path program 1 times [2021-01-06 11:35:50,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:50,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650839319] [2021-01-06 11:35:50,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 11:35:50,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650839319] [2021-01-06 11:35:50,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:50,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:50,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101973566] [2021-01-06 11:35:50,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:50,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:50,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:50,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:50,630 INFO L87 Difference]: Start difference. First operand 1475 states and 2184 transitions. Second operand 3 states. [2021-01-06 11:35:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:50,888 INFO L93 Difference]: Finished difference Result 3138 states and 4656 transitions. [2021-01-06 11:35:50,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:50,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2021-01-06 11:35:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:50,899 INFO L225 Difference]: With dead ends: 3138 [2021-01-06 11:35:50,899 INFO L226 Difference]: Without dead ends: 1671 [2021-01-06 11:35:50,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2021-01-06 11:35:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1555. [2021-01-06 11:35:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2021-01-06 11:35:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2244 transitions. [2021-01-06 11:35:50,976 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2244 transitions. Word has length 159 [2021-01-06 11:35:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:50,981 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 2244 transitions. [2021-01-06 11:35:50,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2244 transitions. [2021-01-06 11:35:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-01-06 11:35:50,991 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:50,991 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 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, 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:35:50,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:35:50,991 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash 442177989, now seen corresponding path program 1 times [2021-01-06 11:35:50,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:50,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703949429] [2021-01-06 11:35:50,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-01-06 11:35:51,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703949429] [2021-01-06 11:35:51,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:51,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:51,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427935124] [2021-01-06 11:35:51,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:51,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:51,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:51,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:51,057 INFO L87 Difference]: Start difference. First operand 1555 states and 2244 transitions. Second operand 3 states. [2021-01-06 11:35:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:51,352 INFO L93 Difference]: Finished difference Result 3158 states and 4542 transitions. [2021-01-06 11:35:51,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:51,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2021-01-06 11:35:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:51,362 INFO L225 Difference]: With dead ends: 3158 [2021-01-06 11:35:51,363 INFO L226 Difference]: Without dead ends: 1611 [2021-01-06 11:35:51,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2021-01-06 11:35:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1555. [2021-01-06 11:35:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2021-01-06 11:35:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2182 transitions. [2021-01-06 11:35:51,458 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2182 transitions. Word has length 173 [2021-01-06 11:35:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:51,459 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 2182 transitions. [2021-01-06 11:35:51,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2182 transitions. [2021-01-06 11:35:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-01-06 11:35:51,464 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:51,465 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:51,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:35:51,465 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:51,466 INFO L82 PathProgramCache]: Analyzing trace with hash 893492071, now seen corresponding path program 1 times [2021-01-06 11:35:51,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:51,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563034460] [2021-01-06 11:35:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-01-06 11:35:51,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563034460] [2021-01-06 11:35:51,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:51,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:51,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799309509] [2021-01-06 11:35:51,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:51,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:51,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:51,545 INFO L87 Difference]: Start difference. First operand 1555 states and 2182 transitions. Second operand 3 states. [2021-01-06 11:35:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:51,752 INFO L93 Difference]: Finished difference Result 3187 states and 4459 transitions. [2021-01-06 11:35:51,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:51,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2021-01-06 11:35:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:51,763 INFO L225 Difference]: With dead ends: 3187 [2021-01-06 11:35:51,763 INFO L226 Difference]: Without dead ends: 1640 [2021-01-06 11:35:51,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2021-01-06 11:35:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1624. [2021-01-06 11:35:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2021-01-06 11:35:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2266 transitions. [2021-01-06 11:35:51,845 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2266 transitions. Word has length 189 [2021-01-06 11:35:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:51,846 INFO L481 AbstractCegarLoop]: Abstraction has 1624 states and 2266 transitions. [2021-01-06 11:35:51,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2266 transitions. [2021-01-06 11:35:51,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-01-06 11:35:51,851 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:51,852 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 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] [2021-01-06 11:35:51,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:35:51,852 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:51,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:51,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1767840956, now seen corresponding path program 1 times [2021-01-06 11:35:51,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:51,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009173671] [2021-01-06 11:35:51,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2021-01-06 11:35:51,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009173671] [2021-01-06 11:35:51,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:51,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:51,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85258538] [2021-01-06 11:35:51,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:51,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:51,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:51,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:51,950 INFO L87 Difference]: Start difference. First operand 1624 states and 2266 transitions. Second operand 3 states. [2021-01-06 11:35:52,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:52,153 INFO L93 Difference]: Finished difference Result 3392 states and 4736 transitions. [2021-01-06 11:35:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:52,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2021-01-06 11:35:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:52,163 INFO L225 Difference]: With dead ends: 3392 [2021-01-06 11:35:52,164 INFO L226 Difference]: Without dead ends: 1776 [2021-01-06 11:35:52,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2021-01-06 11:35:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1724. [2021-01-06 11:35:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2021-01-06 11:35:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2386 transitions. [2021-01-06 11:35:52,243 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2386 transitions. Word has length 210 [2021-01-06 11:35:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:52,244 INFO L481 AbstractCegarLoop]: Abstraction has 1724 states and 2386 transitions. [2021-01-06 11:35:52,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2386 transitions. [2021-01-06 11:35:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-01-06 11:35:52,249 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:52,249 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:52,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:35:52,250 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1550608766, now seen corresponding path program 1 times [2021-01-06 11:35:52,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:52,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197105001] [2021-01-06 11:35:52,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-01-06 11:35:52,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197105001] [2021-01-06 11:35:52,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:52,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:52,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470038937] [2021-01-06 11:35:52,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:52,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:52,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:52,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:52,320 INFO L87 Difference]: Start difference. First operand 1724 states and 2386 transitions. Second operand 3 states. [2021-01-06 11:35:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:52,594 INFO L93 Difference]: Finished difference Result 3494 states and 4822 transitions. [2021-01-06 11:35:52,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:52,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2021-01-06 11:35:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:52,605 INFO L225 Difference]: With dead ends: 3494 [2021-01-06 11:35:52,605 INFO L226 Difference]: Without dead ends: 1778 [2021-01-06 11:35:52,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:52,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2021-01-06 11:35:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1724. [2021-01-06 11:35:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2021-01-06 11:35:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2378 transitions. [2021-01-06 11:35:52,682 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2378 transitions. Word has length 213 [2021-01-06 11:35:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:52,682 INFO L481 AbstractCegarLoop]: Abstraction has 1724 states and 2378 transitions. [2021-01-06 11:35:52,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2378 transitions. [2021-01-06 11:35:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-01-06 11:35:52,688 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:52,689 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:52,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:35:52,689 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:52,689 INFO L82 PathProgramCache]: Analyzing trace with hash -615950364, now seen corresponding path program 1 times [2021-01-06 11:35:52,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:52,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479722132] [2021-01-06 11:35:52,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2021-01-06 11:35:52,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479722132] [2021-01-06 11:35:52,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:52,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:52,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057341338] [2021-01-06 11:35:52,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:52,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:52,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:52,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:52,781 INFO L87 Difference]: Start difference. First operand 1724 states and 2378 transitions. Second operand 3 states. [2021-01-06 11:35:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:53,025 INFO L93 Difference]: Finished difference Result 3636 states and 5036 transitions. [2021-01-06 11:35:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:53,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2021-01-06 11:35:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:53,036 INFO L225 Difference]: With dead ends: 3636 [2021-01-06 11:35:53,037 INFO L226 Difference]: Without dead ends: 1820 [2021-01-06 11:35:53,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2021-01-06 11:35:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1780. [2021-01-06 11:35:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2021-01-06 11:35:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2422 transitions. [2021-01-06 11:35:53,120 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2422 transitions. Word has length 234 [2021-01-06 11:35:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:53,121 INFO L481 AbstractCegarLoop]: Abstraction has 1780 states and 2422 transitions. [2021-01-06 11:35:53,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2422 transitions. [2021-01-06 11:35:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2021-01-06 11:35:53,127 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:53,127 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 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] [2021-01-06 11:35:53,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:35:53,127 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:53,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:53,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1751905145, now seen corresponding path program 1 times [2021-01-06 11:35:53,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:53,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431217873] [2021-01-06 11:35:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2021-01-06 11:35:53,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431217873] [2021-01-06 11:35:53,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:53,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:53,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979288786] [2021-01-06 11:35:53,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:53,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:53,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:53,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:53,241 INFO L87 Difference]: Start difference. First operand 1780 states and 2422 transitions. Second operand 3 states. [2021-01-06 11:35:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:53,440 INFO L93 Difference]: Finished difference Result 3584 states and 4884 transitions. [2021-01-06 11:35:53,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:53,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2021-01-06 11:35:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:53,450 INFO L225 Difference]: With dead ends: 3584 [2021-01-06 11:35:53,450 INFO L226 Difference]: Without dead ends: 1812 [2021-01-06 11:35:53,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:53,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2021-01-06 11:35:53,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1780. [2021-01-06 11:35:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2021-01-06 11:35:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2402 transitions. [2021-01-06 11:35:53,528 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2402 transitions. Word has length 236 [2021-01-06 11:35:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:53,529 INFO L481 AbstractCegarLoop]: Abstraction has 1780 states and 2402 transitions. [2021-01-06 11:35:53,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2402 transitions. [2021-01-06 11:35:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-01-06 11:35:53,535 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:53,535 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 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] [2021-01-06 11:35:53,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:35:53,535 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash 264243297, now seen corresponding path program 1 times [2021-01-06 11:35:53,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:53,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836733540] [2021-01-06 11:35:53,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2021-01-06 11:35:53,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836733540] [2021-01-06 11:35:53,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515245415] [2021-01-06 11:35:53,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:35:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:53,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:35:53,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:35:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2021-01-06 11:35:54,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:35:54,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 11:35:54,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130223349] [2021-01-06 11:35:54,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:54,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:54,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:54,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:35:54,174 INFO L87 Difference]: Start difference. First operand 1780 states and 2402 transitions. Second operand 3 states. [2021-01-06 11:35:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:54,259 INFO L93 Difference]: Finished difference Result 3574 states and 4830 transitions. [2021-01-06 11:35:54,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:54,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2021-01-06 11:35:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:54,272 INFO L225 Difference]: With dead ends: 3574 [2021-01-06 11:35:54,272 INFO L226 Difference]: Without dead ends: 2235 [2021-01-06 11:35:54,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:35:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2021-01-06 11:35:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2235. [2021-01-06 11:35:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2021-01-06 11:35:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 3017 transitions. [2021-01-06 11:35:54,401 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 3017 transitions. Word has length 246 [2021-01-06 11:35:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:54,402 INFO L481 AbstractCegarLoop]: Abstraction has 2235 states and 3017 transitions. [2021-01-06 11:35:54,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 3017 transitions. [2021-01-06 11:35:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-01-06 11:35:54,409 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:54,410 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:35:54,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-06 11:35:54,624 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:54,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1153610059, now seen corresponding path program 1 times [2021-01-06 11:35:54,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:54,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439394549] [2021-01-06 11:35:54,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-01-06 11:35:54,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439394549] [2021-01-06 11:35:54,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130151172] [2021-01-06 11:35:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:35:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:54,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:35:54,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:35:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-01-06 11:35:55,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:35:55,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:35:55,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696746308] [2021-01-06 11:35:55,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:35:55,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:35:55,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:35:55,191 INFO L87 Difference]: Start difference. First operand 2235 states and 3017 transitions. Second operand 4 states. [2021-01-06 11:35:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:55,756 INFO L93 Difference]: Finished difference Result 7149 states and 9661 transitions. [2021-01-06 11:35:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:35:55,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2021-01-06 11:35:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:55,784 INFO L225 Difference]: With dead ends: 7149 [2021-01-06 11:35:55,784 INFO L226 Difference]: Without dead ends: 4922 [2021-01-06 11:35:55,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:35:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4922 states. [2021-01-06 11:35:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4922 to 2780. [2021-01-06 11:35:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2780 states. [2021-01-06 11:35:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 3667 transitions. [2021-01-06 11:35:55,967 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 3667 transitions. Word has length 253 [2021-01-06 11:35:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:55,967 INFO L481 AbstractCegarLoop]: Abstraction has 2780 states and 3667 transitions. [2021-01-06 11:35:55,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:35:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 3667 transitions. [2021-01-06 11:35:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-01-06 11:35:55,976 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:55,977 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:35:56,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-06 11:35:56,191 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:56,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash -864790669, now seen corresponding path program 1 times [2021-01-06 11:35:56,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:56,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484708606] [2021-01-06 11:35:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-01-06 11:35:56,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484708606] [2021-01-06 11:35:56,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:56,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:56,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379482897] [2021-01-06 11:35:56,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:56,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:56,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:56,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:56,347 INFO L87 Difference]: Start difference. First operand 2780 states and 3667 transitions. Second operand 3 states. [2021-01-06 11:35:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:56,496 INFO L93 Difference]: Finished difference Result 7809 states and 10357 transitions. [2021-01-06 11:35:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:56,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2021-01-06 11:35:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:56,509 INFO L225 Difference]: With dead ends: 7809 [2021-01-06 11:35:56,509 INFO L226 Difference]: Without dead ends: 5037 [2021-01-06 11:35:56,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5037 states. [2021-01-06 11:35:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5037 to 5035. [2021-01-06 11:35:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5035 states. [2021-01-06 11:35:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6687 transitions. [2021-01-06 11:35:56,722 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6687 transitions. Word has length 253 [2021-01-06 11:35:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:56,723 INFO L481 AbstractCegarLoop]: Abstraction has 5035 states and 6687 transitions. [2021-01-06 11:35:56,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6687 transitions. [2021-01-06 11:35:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-01-06 11:35:56,734 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:56,735 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:56,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:35:56,735 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash 52349753, now seen corresponding path program 1 times [2021-01-06 11:35:56,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:56,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336666474] [2021-01-06 11:35:56,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-01-06 11:35:56,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336666474] [2021-01-06 11:35:56,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:56,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:56,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6667726] [2021-01-06 11:35:56,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:56,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:56,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:56,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:56,881 INFO L87 Difference]: Start difference. First operand 5035 states and 6687 transitions. Second operand 3 states. [2021-01-06 11:35:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:57,299 INFO L93 Difference]: Finished difference Result 10162 states and 13482 transitions. [2021-01-06 11:35:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:57,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2021-01-06 11:35:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:57,315 INFO L225 Difference]: With dead ends: 10162 [2021-01-06 11:35:57,315 INFO L226 Difference]: Without dead ends: 5135 [2021-01-06 11:35:57,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2021-01-06 11:35:57,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 5035. [2021-01-06 11:35:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5035 states. [2021-01-06 11:35:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6601 transitions. [2021-01-06 11:35:57,559 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6601 transitions. Word has length 256 [2021-01-06 11:35:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:57,559 INFO L481 AbstractCegarLoop]: Abstraction has 5035 states and 6601 transitions. [2021-01-06 11:35:57,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6601 transitions. [2021-01-06 11:35:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-01-06 11:35:57,571 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:57,572 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:35:57,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:35:57,572 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:57,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:57,573 INFO L82 PathProgramCache]: Analyzing trace with hash 212492165, now seen corresponding path program 1 times [2021-01-06 11:35:57,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:57,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756245787] [2021-01-06 11:35:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-01-06 11:35:57,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756245787] [2021-01-06 11:35:57,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098455357] [2021-01-06 11:35:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:35:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:57,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:35:57,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:35:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2021-01-06 11:35:58,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:35:58,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 11:35:58,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980168037] [2021-01-06 11:35:58,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:58,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:58,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:58,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:35:58,142 INFO L87 Difference]: Start difference. First operand 5035 states and 6601 transitions. Second operand 3 states. [2021-01-06 11:35:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:58,491 INFO L93 Difference]: Finished difference Result 9422 states and 12426 transitions. [2021-01-06 11:35:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:58,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2021-01-06 11:35:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:58,504 INFO L225 Difference]: With dead ends: 9422 [2021-01-06 11:35:58,504 INFO L226 Difference]: Without dead ends: 5375 [2021-01-06 11:35:58,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:35:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5375 states. [2021-01-06 11:35:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5375 to 5055. [2021-01-06 11:35:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5055 states. [2021-01-06 11:35:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 6607 transitions. [2021-01-06 11:35:58,772 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 6607 transitions. Word has length 282 [2021-01-06 11:35:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:58,773 INFO L481 AbstractCegarLoop]: Abstraction has 5055 states and 6607 transitions. [2021-01-06 11:35:58,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 6607 transitions. [2021-01-06 11:35:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-01-06 11:35:58,784 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:58,785 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:35:58,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:35:58,999 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:59,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:59,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1760130215, now seen corresponding path program 1 times [2021-01-06 11:35:59,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:59,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39367519] [2021-01-06 11:35:59,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-01-06 11:35:59,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39367519] [2021-01-06 11:35:59,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151846693] [2021-01-06 11:35:59,114 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:35:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:59,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:35:59,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:35:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2021-01-06 11:35:59,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:35:59,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 11:35:59,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713574559] [2021-01-06 11:35:59,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:59,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:59,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:35:59,444 INFO L87 Difference]: Start difference. First operand 5055 states and 6607 transitions. Second operand 3 states. [2021-01-06 11:35:59,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:59,714 INFO L93 Difference]: Finished difference Result 10102 states and 13202 transitions. [2021-01-06 11:35:59,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:59,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2021-01-06 11:35:59,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:59,726 INFO L225 Difference]: With dead ends: 10102 [2021-01-06 11:35:59,727 INFO L226 Difference]: Without dead ends: 5055 [2021-01-06 11:35:59,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:35:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5055 states. [2021-01-06 11:35:59,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5055 to 5055. [2021-01-06 11:35:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5055 states. [2021-01-06 11:35:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 6597 transitions. [2021-01-06 11:35:59,920 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 6597 transitions. Word has length 283 [2021-01-06 11:35:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:59,921 INFO L481 AbstractCegarLoop]: Abstraction has 5055 states and 6597 transitions. [2021-01-06 11:35:59,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 6597 transitions. [2021-01-06 11:35:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-01-06 11:35:59,932 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:59,932 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:36:00,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:00,147 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:00,148 INFO L82 PathProgramCache]: Analyzing trace with hash 228335597, now seen corresponding path program 1 times [2021-01-06 11:36:00,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:00,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414411454] [2021-01-06 11:36:00,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-01-06 11:36:00,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414411454] [2021-01-06 11:36:00,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071675101] [2021-01-06 11:36:00,281 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:00,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:36:00,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:36:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-01-06 11:36:00,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:36:00,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:36:00,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706716314] [2021-01-06 11:36:00,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:36:00,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:00,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:36:00,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:36:00,731 INFO L87 Difference]: Start difference. First operand 5055 states and 6597 transitions. Second operand 4 states. [2021-01-06 11:36:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:01,342 INFO L93 Difference]: Finished difference Result 11826 states and 15346 transitions. [2021-01-06 11:36:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:36:01,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2021-01-06 11:36:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:01,359 INFO L225 Difference]: With dead ends: 11826 [2021-01-06 11:36:01,359 INFO L226 Difference]: Without dead ends: 6713 [2021-01-06 11:36:01,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 285 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:36:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6713 states. [2021-01-06 11:36:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6713 to 4419. [2021-01-06 11:36:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2021-01-06 11:36:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 5676 transitions. [2021-01-06 11:36:01,579 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 5676 transitions. Word has length 283 [2021-01-06 11:36:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:01,580 INFO L481 AbstractCegarLoop]: Abstraction has 4419 states and 5676 transitions. [2021-01-06 11:36:01,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:36:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 5676 transitions. [2021-01-06 11:36:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2021-01-06 11:36:01,592 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:01,593 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2021-01-06 11:36:01,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-01-06 11:36:01,808 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:01,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1511923228, now seen corresponding path program 1 times [2021-01-06 11:36:01,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:01,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115945817] [2021-01-06 11:36:01,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2021-01-06 11:36:02,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115945817] [2021-01-06 11:36:02,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:02,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:02,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333442040] [2021-01-06 11:36:02,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:02,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:02,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:02,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:02,010 INFO L87 Difference]: Start difference. First operand 4419 states and 5676 transitions. Second operand 3 states. [2021-01-06 11:36:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:02,214 INFO L93 Difference]: Finished difference Result 7455 states and 9474 transitions. [2021-01-06 11:36:02,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:02,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2021-01-06 11:36:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:02,220 INFO L225 Difference]: With dead ends: 7455 [2021-01-06 11:36:02,220 INFO L226 Difference]: Without dead ends: 2236 [2021-01-06 11:36:02,227 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:36:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2021-01-06 11:36:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2236. [2021-01-06 11:36:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2236 states. [2021-01-06 11:36:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2826 transitions. [2021-01-06 11:36:02,306 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2826 transitions. Word has length 321 [2021-01-06 11:36:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:02,307 INFO L481 AbstractCegarLoop]: Abstraction has 2236 states and 2826 transitions. [2021-01-06 11:36:02,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2826 transitions. [2021-01-06 11:36:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-01-06 11:36:02,312 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:02,313 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:02,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:36:02,313 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:02,314 INFO L82 PathProgramCache]: Analyzing trace with hash 761483812, now seen corresponding path program 1 times [2021-01-06 11:36:02,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:02,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538811016] [2021-01-06 11:36:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-01-06 11:36:02,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538811016] [2021-01-06 11:36:02,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:02,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:02,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169938109] [2021-01-06 11:36:02,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:02,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:02,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:02,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:02,456 INFO L87 Difference]: Start difference. First operand 2236 states and 2826 transitions. Second operand 3 states. [2021-01-06 11:36:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:02,735 INFO L93 Difference]: Finished difference Result 4474 states and 5650 transitions. [2021-01-06 11:36:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:02,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2021-01-06 11:36:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:02,748 INFO L225 Difference]: With dead ends: 4474 [2021-01-06 11:36:02,748 INFO L226 Difference]: Without dead ends: 2246 [2021-01-06 11:36:02,752 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:36:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2021-01-06 11:36:02,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2236. [2021-01-06 11:36:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2236 states. [2021-01-06 11:36:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2801 transitions. [2021-01-06 11:36:02,880 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2801 transitions. Word has length 360 [2021-01-06 11:36:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:02,881 INFO L481 AbstractCegarLoop]: Abstraction has 2236 states and 2801 transitions. [2021-01-06 11:36:02,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2801 transitions. [2021-01-06 11:36:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2021-01-06 11:36:02,888 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:02,888 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2021-01-06 11:36:02,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:36:02,889 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:02,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:02,889 INFO L82 PathProgramCache]: Analyzing trace with hash 35349519, now seen corresponding path program 1 times [2021-01-06 11:36:02,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:02,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939852984] [2021-01-06 11:36:02,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-01-06 11:36:03,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939852984] [2021-01-06 11:36:03,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799219772] [2021-01-06 11:36:03,126 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:03,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:36:03,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:36:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2021-01-06 11:36:03,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:36:03,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 11:36:03,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376803135] [2021-01-06 11:36:03,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:03,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:03,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:03,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:36:03,733 INFO L87 Difference]: Start difference. First operand 2236 states and 2801 transitions. Second operand 3 states. [2021-01-06 11:36:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:03,817 INFO L93 Difference]: Finished difference Result 2855 states and 3603 transitions. [2021-01-06 11:36:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:03,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2021-01-06 11:36:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:03,823 INFO L225 Difference]: With dead ends: 2855 [2021-01-06 11:36:03,823 INFO L226 Difference]: Without dead ends: 2763 [2021-01-06 11:36:03,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:36:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2021-01-06 11:36:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2146. [2021-01-06 11:36:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2021-01-06 11:36:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2700 transitions. [2021-01-06 11:36:03,935 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2700 transitions. Word has length 393 [2021-01-06 11:36:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:03,936 INFO L481 AbstractCegarLoop]: Abstraction has 2146 states and 2700 transitions. [2021-01-06 11:36:03,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2700 transitions. [2021-01-06 11:36:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2021-01-06 11:36:03,945 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:03,945 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:04,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:04,159 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:04,160 INFO L82 PathProgramCache]: Analyzing trace with hash 431667755, now seen corresponding path program 1 times [2021-01-06 11:36:04,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:04,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568455591] [2021-01-06 11:36:04,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2021-01-06 11:36:04,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568455591] [2021-01-06 11:36:04,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119492476] [2021-01-06 11:36:04,433 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:04,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:36:04,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:36:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2021-01-06 11:36:05,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:36:05,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:36:05,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764784955] [2021-01-06 11:36:05,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:36:05,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:36:05,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:36:05,199 INFO L87 Difference]: Start difference. First operand 2146 states and 2700 transitions. Second operand 4 states. [2021-01-06 11:36:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:05,606 INFO L93 Difference]: Finished difference Result 5212 states and 6569 transitions. [2021-01-06 11:36:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:36:05,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 533 [2021-01-06 11:36:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:05,613 INFO L225 Difference]: With dead ends: 5212 [2021-01-06 11:36:05,613 INFO L226 Difference]: Without dead ends: 3032 [2021-01-06 11:36:05,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 535 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:36:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2021-01-06 11:36:05,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2206. [2021-01-06 11:36:05,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2021-01-06 11:36:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 2780 transitions. [2021-01-06 11:36:05,698 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 2780 transitions. Word has length 533 [2021-01-06 11:36:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:05,699 INFO L481 AbstractCegarLoop]: Abstraction has 2206 states and 2780 transitions. [2021-01-06 11:36:05,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:36:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2780 transitions. [2021-01-06 11:36:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2021-01-06 11:36:05,709 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:05,710 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:05,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-01-06 11:36:05,925 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:05,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:05,926 INFO L82 PathProgramCache]: Analyzing trace with hash 316649701, now seen corresponding path program 1 times [2021-01-06 11:36:05,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:05,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180475881] [2021-01-06 11:36:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2021-01-06 11:36:06,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180475881] [2021-01-06 11:36:06,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:06,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:06,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875031535] [2021-01-06 11:36:06,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:06,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:06,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:06,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:06,246 INFO L87 Difference]: Start difference. First operand 2206 states and 2780 transitions. Second operand 3 states. [2021-01-06 11:36:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:06,448 INFO L93 Difference]: Finished difference Result 4584 states and 5788 transitions. [2021-01-06 11:36:06,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:06,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 595 [2021-01-06 11:36:06,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:06,454 INFO L225 Difference]: With dead ends: 4584 [2021-01-06 11:36:06,455 INFO L226 Difference]: Without dead ends: 2386 [2021-01-06 11:36:06,458 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:36:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2021-01-06 11:36:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2376. [2021-01-06 11:36:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2376 states. [2021-01-06 11:36:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 2975 transitions. [2021-01-06 11:36:06,542 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 2975 transitions. Word has length 595 [2021-01-06 11:36:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:06,542 INFO L481 AbstractCegarLoop]: Abstraction has 2376 states and 2975 transitions. [2021-01-06 11:36:06,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2975 transitions. [2021-01-06 11:36:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2021-01-06 11:36:06,553 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:06,554 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:06,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 11:36:06,554 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1796704043, now seen corresponding path program 1 times [2021-01-06 11:36:06,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:06,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615873154] [2021-01-06 11:36:06,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2021-01-06 11:36:06,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615873154] [2021-01-06 11:36:06,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:06,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:06,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846376237] [2021-01-06 11:36:06,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:06,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:06,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:06,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:06,857 INFO L87 Difference]: Start difference. First operand 2376 states and 2975 transitions. Second operand 3 states. [2021-01-06 11:36:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:07,061 INFO L93 Difference]: Finished difference Result 4739 states and 5928 transitions. [2021-01-06 11:36:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:07,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 657 [2021-01-06 11:36:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:07,067 INFO L225 Difference]: With dead ends: 4739 [2021-01-06 11:36:07,067 INFO L226 Difference]: Without dead ends: 2371 [2021-01-06 11:36:07,070 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:36:07,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2021-01-06 11:36:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2371. [2021-01-06 11:36:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2371 states. [2021-01-06 11:36:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 2920 transitions. [2021-01-06 11:36:07,149 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 2920 transitions. Word has length 657 [2021-01-06 11:36:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:07,150 INFO L481 AbstractCegarLoop]: Abstraction has 2371 states and 2920 transitions. [2021-01-06 11:36:07,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2920 transitions. [2021-01-06 11:36:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2021-01-06 11:36:07,159 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:07,159 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:07,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 11:36:07,159 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:07,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:07,160 INFO L82 PathProgramCache]: Analyzing trace with hash -372840571, now seen corresponding path program 1 times [2021-01-06 11:36:07,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:07,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110526347] [2021-01-06 11:36:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2021-01-06 11:36:07,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110526347] [2021-01-06 11:36:07,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419160926] [2021-01-06 11:36:07,583 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:07,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:36:07,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:36:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2021-01-06 11:36:08,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:36:08,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:36:08,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355254382] [2021-01-06 11:36:08,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:36:08,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:36:08,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:36:08,556 INFO L87 Difference]: Start difference. First operand 2371 states and 2920 transitions. Second operand 4 states. [2021-01-06 11:36:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:08,807 INFO L93 Difference]: Finished difference Result 4081 states and 5070 transitions. [2021-01-06 11:36:08,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:36:08,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 723 [2021-01-06 11:36:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:08,809 INFO L225 Difference]: With dead ends: 4081 [2021-01-06 11:36:08,809 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 11:36:08,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 725 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:36:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 11:36:08,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 11:36:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 11:36:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 11:36:08,814 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 723 [2021-01-06 11:36:08,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:08,814 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 11:36:08,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:36:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 11:36:08,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 11:36:09,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-01-06 11:36:09,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 11:36:09,147 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2021-01-06 11:36:10,943 WARN L197 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 437 DAG size of output: 270 [2021-01-06 11:36:11,129 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2021-01-06 11:36:12,178 WARN L197 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 437 DAG size of output: 270 [2021-01-06 11:36:13,022 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 33 [2021-01-06 11:36:13,335 WARN L197 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2021-01-06 11:36:13,878 WARN L197 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 42 [2021-01-06 11:36:14,364 WARN L197 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 32 [2021-01-06 11:36:19,421 WARN L197 SmtUtils]: Spent 5.05 s on a formula simplification. DAG size of input: 220 DAG size of output: 111 [2021-01-06 11:36:20,004 WARN L197 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 34 [2021-01-06 11:36:20,710 WARN L197 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2021-01-06 11:36:21,274 WARN L197 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 24 [2021-01-06 11:36:21,644 WARN L197 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2021-01-06 11:36:22,129 WARN L197 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2021-01-06 11:36:27,062 WARN L197 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 220 DAG size of output: 111 [2021-01-06 11:36:27,640 WARN L197 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 34 [2021-01-06 11:36:28,098 WARN L197 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 26 [2021-01-06 11:36:28,732 WARN L197 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2021-01-06 11:36:29,161 WARN L197 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 29 [2021-01-06 11:36:29,423 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2021-01-06 11:36:29,823 WARN L197 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2021-01-06 11:36:30,204 WARN L197 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 29 [2021-01-06 11:36:30,615 WARN L197 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2021-01-06 11:36:31,155 WARN L197 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 33 [2021-01-06 11:36:31,594 WARN L197 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 19 [2021-01-06 11:36:31,598 INFO L189 CegarLoopUtils]: For program point L531(lines 531 537) no Hoare annotation was computed. [2021-01-06 11:36:31,598 INFO L189 CegarLoopUtils]: For program point L498(lines 498 500) no Hoare annotation was computed. [2021-01-06 11:36:31,598 INFO L189 CegarLoopUtils]: For program point L531-1(lines 531 537) no Hoare annotation was computed. [2021-01-06 11:36:31,599 INFO L189 CegarLoopUtils]: For program point L498-2(lines 209 543) no Hoare annotation was computed. [2021-01-06 11:36:31,599 INFO L189 CegarLoopUtils]: For program point L202(lines 202 547) no Hoare annotation was computed. [2021-01-06 11:36:31,599 INFO L189 CegarLoopUtils]: For program point L169(lines 169 558) no Hoare annotation was computed. [2021-01-06 11:36:31,599 INFO L189 CegarLoopUtils]: For program point L136(lines 136 569) no Hoare annotation was computed. [2021-01-06 11:36:31,599 INFO L189 CegarLoopUtils]: For program point L103(lines 103 580) no Hoare annotation was computed. [2021-01-06 11:36:31,599 INFO L189 CegarLoopUtils]: For program point L434(lines 434 437) no Hoare annotation was computed. [2021-01-06 11:36:31,599 INFO L189 CegarLoopUtils]: For program point L335(lines 335 373) no Hoare annotation was computed. [2021-01-06 11:36:31,600 INFO L185 CegarLoopUtils]: At program point L203(lines 199 548) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4))) [2021-01-06 11:36:31,600 INFO L185 CegarLoopUtils]: At program point L104(lines 103 580) the Hoare annotation is: false [2021-01-06 11:36:31,600 INFO L192 CegarLoopUtils]: At program point L600(lines 99 601) the Hoare annotation is: true [2021-01-06 11:36:31,600 INFO L189 CegarLoopUtils]: For program point L534(lines 534 536) no Hoare annotation was computed. [2021-01-06 11:36:31,600 INFO L185 CegarLoopUtils]: At program point L402(lines 393 411) the Hoare annotation is: (let ((.cse0 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3))) [2021-01-06 11:36:31,600 INFO L189 CegarLoopUtils]: For program point L205(lines 205 546) no Hoare annotation was computed. [2021-01-06 11:36:31,600 INFO L189 CegarLoopUtils]: For program point L172(lines 172 557) no Hoare annotation was computed. [2021-01-06 11:36:31,600 INFO L189 CegarLoopUtils]: For program point L139(lines 139 568) no Hoare annotation was computed. [2021-01-06 11:36:31,601 INFO L189 CegarLoopUtils]: For program point L106(lines 106 579) no Hoare annotation was computed. [2021-01-06 11:36:31,601 INFO L189 CegarLoopUtils]: For program point L338(lines 338 372) no Hoare annotation was computed. [2021-01-06 11:36:31,601 INFO L189 CegarLoopUtils]: For program point L338-1(lines 338 372) no Hoare annotation was computed. [2021-01-06 11:36:31,601 INFO L185 CegarLoopUtils]: At program point L206(lines 205 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-01-06 11:36:31,601 INFO L185 CegarLoopUtils]: At program point L173(lines 169 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse5 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5))) [2021-01-06 11:36:31,601 INFO L185 CegarLoopUtils]: At program point L140(lines 136 569) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (<= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse8) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5 .cse6 .cse7 .cse8))) [2021-01-06 11:36:31,601 INFO L189 CegarLoopUtils]: For program point L471(lines 471 473) no Hoare annotation was computed. [2021-01-06 11:36:31,602 INFO L189 CegarLoopUtils]: For program point L405(lines 405 407) no Hoare annotation was computed. [2021-01-06 11:36:31,602 INFO L189 CegarLoopUtils]: For program point L339(lines 339 369) no Hoare annotation was computed. [2021-01-06 11:36:31,602 INFO L185 CegarLoopUtils]: At program point L208(lines 207 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-01-06 11:36:31,602 INFO L189 CegarLoopUtils]: For program point L175(lines 175 556) no Hoare annotation was computed. [2021-01-06 11:36:31,602 INFO L189 CegarLoopUtils]: For program point L142(lines 142 567) no Hoare annotation was computed. [2021-01-06 11:36:31,602 INFO L189 CegarLoopUtils]: For program point L109(lines 109 578) no Hoare annotation was computed. [2021-01-06 11:36:31,602 INFO L189 CegarLoopUtils]: For program point L605(lines 605 607) no Hoare annotation was computed. [2021-01-06 11:36:31,602 INFO L189 CegarLoopUtils]: For program point L605-2(lines 605 607) no Hoare annotation was computed. [2021-01-06 11:36:31,602 INFO L189 CegarLoopUtils]: For program point L506(lines 506 509) no Hoare annotation was computed. [2021-01-06 11:36:31,602 INFO L189 CegarLoopUtils]: For program point L275(lines 275 277) no Hoare annotation was computed. [2021-01-06 11:36:31,603 INFO L189 CegarLoopUtils]: For program point L275-2(lines 209 543) no Hoare annotation was computed. [2021-01-06 11:36:31,603 INFO L189 CegarLoopUtils]: For program point L309(lines 309 316) no Hoare annotation was computed. [2021-01-06 11:36:31,603 INFO L189 CegarLoopUtils]: For program point L309-2(lines 309 316) no Hoare annotation was computed. [2021-01-06 11:36:31,603 INFO L189 CegarLoopUtils]: For program point L244(lines 244 254) no Hoare annotation was computed. [2021-01-06 11:36:31,603 INFO L189 CegarLoopUtils]: For program point L178(lines 178 555) no Hoare annotation was computed. [2021-01-06 11:36:31,603 INFO L189 CegarLoopUtils]: For program point L145(lines 145 566) no Hoare annotation was computed. [2021-01-06 11:36:31,603 INFO L189 CegarLoopUtils]: For program point L112(lines 112 577) no Hoare annotation was computed. [2021-01-06 11:36:31,603 INFO L189 CegarLoopUtils]: For program point L344(lines 344 367) no Hoare annotation was computed. [2021-01-06 11:36:31,603 INFO L189 CegarLoopUtils]: For program point L245(lines 245 248) no Hoare annotation was computed. [2021-01-06 11:36:31,604 INFO L185 CegarLoopUtils]: At program point L212(lines 106 579) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse2 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-01-06 11:36:31,604 INFO L185 CegarLoopUtils]: At program point L179(lines 175 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse5 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5))) [2021-01-06 11:36:31,604 INFO L185 CegarLoopUtils]: At program point L146(lines 142 567) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5))) [2021-01-06 11:36:31,604 INFO L192 CegarLoopUtils]: At program point L610(lines 12 612) the Hoare annotation is: true [2021-01-06 11:36:31,605 INFO L185 CegarLoopUtils]: At program point L544(lines 100 599) the Hoare annotation is: (let ((.cse30 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse31 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse14 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse22 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse18 (not .cse14)) (.cse19 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not .cse31)) (.cse10 (not .cse30)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse15 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse17 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse12 .cse17 .cse18) (and .cse8 .cse5 .cse19 .cse18) (and .cse16 .cse20) (and .cse8 .cse0 .cse14 .cse2) (and .cse3 .cse12 .cse17) (and .cse1 .cse12 .cse17) (and .cse7 .cse21 .cse1 .cse22 .cse23 .cse11 .cse2 .cse24 .cse25) (and .cse26 .cse16 .cse24 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse18) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse27 .cse26 .cse14 .cse24) (and .cse8 .cse20) (and .cse0 .cse27 .cse4 .cse5 .cse6 .cse28) (and .cse27 .cse4 .cse5 .cse6 .cse28 .cse18) (and .cse8 .cse12 .cse17 .cse18) (and .cse8 .cse14 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse7 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse21 .cse22 .cse23 .cse11 .cse2 .cse24 .cse25) (and .cse7 .cse1 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse3 .cse2) (and .cse7 .cse3 .cse11 .cse29 .cse12 .cse15) (and .cse27 .cse5 .cse16 .cse19 .cse18) (and .cse8 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse14) (and .cse0 .cse8 .cse5 .cse19) (and .cse8 .cse14 .cse30) (and .cse7 .cse3 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse14 .cse31) (and .cse7 .cse1 .cse10 .cse11 .cse29 .cse12 .cse15) (and .cse4 .cse5 .cse1 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse14 .cse15) (and .cse0 .cse8 .cse12 .cse17)))) [2021-01-06 11:36:31,605 INFO L189 CegarLoopUtils]: For program point L445(lines 445 447) no Hoare annotation was computed. [2021-01-06 11:36:31,605 INFO L189 CegarLoopUtils]: For program point L313(lines 313 315) no Hoare annotation was computed. [2021-01-06 11:36:31,605 INFO L189 CegarLoopUtils]: For program point L181(lines 181 554) no Hoare annotation was computed. [2021-01-06 11:36:31,605 INFO L189 CegarLoopUtils]: For program point L148(lines 148 565) no Hoare annotation was computed. [2021-01-06 11:36:31,605 INFO L189 CegarLoopUtils]: For program point L115(lines 115 576) no Hoare annotation was computed. [2021-01-06 11:36:31,605 INFO L189 CegarLoopUtils]: For program point L347(lines 347 351) no Hoare annotation was computed. [2021-01-06 11:36:31,606 INFO L189 CegarLoopUtils]: For program point L347-2(lines 347 351) no Hoare annotation was computed. [2021-01-06 11:36:31,606 INFO L189 CegarLoopUtils]: For program point L83(lines 83 89) no Hoare annotation was computed. [2021-01-06 11:36:31,606 INFO L189 CegarLoopUtils]: For program point L480(lines 480 482) no Hoare annotation was computed. [2021-01-06 11:36:31,606 INFO L189 CegarLoopUtils]: For program point L381(lines 381 413) no Hoare annotation was computed. [2021-01-06 11:36:31,606 INFO L189 CegarLoopUtils]: For program point L514(lines 514 516) no Hoare annotation was computed. [2021-01-06 11:36:31,606 INFO L189 CegarLoopUtils]: For program point L448(lines 448 457) no Hoare annotation was computed. [2021-01-06 11:36:31,606 INFO L189 CegarLoopUtils]: For program point L382(lines 382 388) no Hoare annotation was computed. [2021-01-06 11:36:31,606 INFO L189 CegarLoopUtils]: For program point L217(lines 217 219) no Hoare annotation was computed. [2021-01-06 11:36:31,606 INFO L189 CegarLoopUtils]: For program point L184(lines 184 553) no Hoare annotation was computed. [2021-01-06 11:36:31,606 INFO L189 CegarLoopUtils]: For program point L151(lines 151 564) no Hoare annotation was computed. [2021-01-06 11:36:31,606 INFO L189 CegarLoopUtils]: For program point L217-2(lines 217 219) no Hoare annotation was computed. [2021-01-06 11:36:31,607 INFO L189 CegarLoopUtils]: For program point L118(lines 118 575) no Hoare annotation was computed. [2021-01-06 11:36:31,607 INFO L189 CegarLoopUtils]: For program point L581(lines 581 597) no Hoare annotation was computed. [2021-01-06 11:36:31,607 INFO L185 CegarLoopUtils]: At program point L515(lines 73 611) the Hoare annotation is: false [2021-01-06 11:36:31,607 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 11:36:31,607 INFO L185 CegarLoopUtils]: At program point L185(lines 181 554) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0))) [2021-01-06 11:36:31,607 INFO L185 CegarLoopUtils]: At program point L152(lines 148 565) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5))) [2021-01-06 11:36:31,607 INFO L189 CegarLoopUtils]: For program point L86(lines 86 88) no Hoare annotation was computed. [2021-01-06 11:36:31,608 INFO L189 CegarLoopUtils]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2021-01-06 11:36:31,608 INFO L189 CegarLoopUtils]: For program point L582(lines 582 596) no Hoare annotation was computed. [2021-01-06 11:36:31,608 INFO L189 CegarLoopUtils]: For program point L483(lines 483 487) no Hoare annotation was computed. [2021-01-06 11:36:31,608 INFO L189 CegarLoopUtils]: For program point L483-2(lines 483 487) no Hoare annotation was computed. [2021-01-06 11:36:31,608 INFO L189 CegarLoopUtils]: For program point L583(lines 583 588) no Hoare annotation was computed. [2021-01-06 11:36:31,608 INFO L189 CegarLoopUtils]: For program point L517(lines 517 519) no Hoare annotation was computed. [2021-01-06 11:36:31,608 INFO L189 CegarLoopUtils]: For program point L583-2(lines 582 596) no Hoare annotation was computed. [2021-01-06 11:36:31,608 INFO L189 CegarLoopUtils]: For program point L187(lines 187 552) no Hoare annotation was computed. [2021-01-06 11:36:31,608 INFO L189 CegarLoopUtils]: For program point L154(lines 154 563) no Hoare annotation was computed. [2021-01-06 11:36:31,608 INFO L189 CegarLoopUtils]: For program point L121(lines 121 574) no Hoare annotation was computed. [2021-01-06 11:36:31,608 INFO L189 CegarLoopUtils]: For program point L452(lines 452 454) no Hoare annotation was computed. [2021-01-06 11:36:31,609 INFO L185 CegarLoopUtils]: At program point L122(lines 118 575) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) [2021-01-06 11:36:31,609 INFO L189 CegarLoopUtils]: For program point L585(lines 585 587) no Hoare annotation was computed. [2021-01-06 11:36:31,609 INFO L189 CegarLoopUtils]: For program point L288(lines 288 294) no Hoare annotation was computed. [2021-01-06 11:36:31,609 INFO L189 CegarLoopUtils]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-01-06 11:36:31,609 INFO L189 CegarLoopUtils]: For program point L355(lines 355 363) no Hoare annotation was computed. [2021-01-06 11:36:31,609 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 11:36:31,609 INFO L189 CegarLoopUtils]: For program point L190(lines 190 551) no Hoare annotation was computed. [2021-01-06 11:36:31,609 INFO L189 CegarLoopUtils]: For program point L157(lines 157 562) no Hoare annotation was computed. [2021-01-06 11:36:31,609 INFO L189 CegarLoopUtils]: For program point L124(lines 124 573) no Hoare annotation was computed. [2021-01-06 11:36:31,610 INFO L189 CegarLoopUtils]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-01-06 11:36:31,610 INFO L189 CegarLoopUtils]: For program point L91-1(lines 73 611) no Hoare annotation was computed. [2021-01-06 11:36:31,610 INFO L189 CegarLoopUtils]: For program point L521(lines 521 525) no Hoare annotation was computed. [2021-01-06 11:36:31,610 INFO L189 CegarLoopUtils]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2021-01-06 11:36:31,610 INFO L185 CegarLoopUtils]: At program point L356(lines 332 374) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5))) [2021-01-06 11:36:31,610 INFO L185 CegarLoopUtils]: At program point L191(lines 187 552) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse0 .cse1) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1))) [2021-01-06 11:36:31,610 INFO L185 CegarLoopUtils]: At program point L158(lines 154 563) the Hoare annotation is: (let ((.cse0 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3))) [2021-01-06 11:36:31,611 INFO L185 CegarLoopUtils]: At program point L125(lines 124 573) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-01-06 11:36:31,611 INFO L189 CegarLoopUtils]: For program point L92(lines 92 94) no Hoare annotation was computed. [2021-01-06 11:36:31,611 INFO L189 CegarLoopUtils]: For program point L423(lines 423 425) no Hoare annotation was computed. [2021-01-06 11:36:31,611 INFO L185 CegarLoopUtils]: At program point L390(lines 381 413) the Hoare annotation is: (let ((.cse0 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3))) [2021-01-06 11:36:31,611 INFO L189 CegarLoopUtils]: For program point L291(lines 291 293) no Hoare annotation was computed. [2021-01-06 11:36:31,611 INFO L189 CegarLoopUtils]: For program point L291-2(lines 209 543) no Hoare annotation was computed. [2021-01-06 11:36:31,611 INFO L192 CegarLoopUtils]: At program point L622(lines 613 624) the Hoare annotation is: true [2021-01-06 11:36:31,611 INFO L189 CegarLoopUtils]: For program point L358(lines 358 360) no Hoare annotation was computed. [2021-01-06 11:36:31,611 INFO L189 CegarLoopUtils]: For program point L193(lines 193 550) no Hoare annotation was computed. [2021-01-06 11:36:31,611 INFO L189 CegarLoopUtils]: For program point L160(lines 160 561) no Hoare annotation was computed. [2021-01-06 11:36:31,612 INFO L189 CegarLoopUtils]: For program point L127(lines 127 572) no Hoare annotation was computed. [2021-01-06 11:36:31,612 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 11:36:31,612 INFO L189 CegarLoopUtils]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-01-06 11:36:31,612 INFO L189 CegarLoopUtils]: For program point L326(lines 326 330) no Hoare annotation was computed. [2021-01-06 11:36:31,612 INFO L189 CegarLoopUtils]: For program point L260(lines 260 262) no Hoare annotation was computed. [2021-01-06 11:36:31,612 INFO L189 CegarLoopUtils]: For program point L326-2(lines 209 543) no Hoare annotation was computed. [2021-01-06 11:36:31,612 INFO L189 CegarLoopUtils]: For program point L227(lines 227 238) no Hoare annotation was computed. [2021-01-06 11:36:31,612 INFO L189 CegarLoopUtils]: For program point L227-2(lines 209 543) no Hoare annotation was computed. [2021-01-06 11:36:31,612 INFO L189 CegarLoopUtils]: For program point L393(lines 393 411) no Hoare annotation was computed. [2021-01-06 11:36:31,612 INFO L189 CegarLoopUtils]: For program point L493(lines 493 496) no Hoare annotation was computed. [2021-01-06 11:36:31,612 INFO L189 CegarLoopUtils]: For program point L394(lines 394 400) no Hoare annotation was computed. [2021-01-06 11:36:31,613 INFO L189 CegarLoopUtils]: For program point L229(lines 229 232) no Hoare annotation was computed. [2021-01-06 11:36:31,613 INFO L189 CegarLoopUtils]: For program point L196(lines 196 549) no Hoare annotation was computed. [2021-01-06 11:36:31,613 INFO L189 CegarLoopUtils]: For program point L163(lines 163 560) no Hoare annotation was computed. [2021-01-06 11:36:31,613 INFO L189 CegarLoopUtils]: For program point L130(lines 130 571) no Hoare annotation was computed. [2021-01-06 11:36:31,613 INFO L185 CegarLoopUtils]: At program point L197(lines 193 550) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse3 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse2 .cse5))) [2021-01-06 11:36:31,613 INFO L185 CegarLoopUtils]: At program point L164(lines 160 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse2 .cse3))) [2021-01-06 11:36:31,613 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 11:36:31,613 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 609) no Hoare annotation was computed. [2021-01-06 11:36:31,614 INFO L189 CegarLoopUtils]: For program point L462(lines 462 464) no Hoare annotation was computed. [2021-01-06 11:36:31,614 INFO L189 CegarLoopUtils]: For program point L298(lines 298 302) no Hoare annotation was computed. [2021-01-06 11:36:31,614 INFO L189 CegarLoopUtils]: For program point L298-2(lines 298 302) no Hoare annotation was computed. [2021-01-06 11:36:31,614 INFO L189 CegarLoopUtils]: For program point L199(lines 199 548) no Hoare annotation was computed. [2021-01-06 11:36:31,614 INFO L189 CegarLoopUtils]: For program point L166(lines 166 559) no Hoare annotation was computed. [2021-01-06 11:36:31,614 INFO L189 CegarLoopUtils]: For program point L133(lines 133 570) no Hoare annotation was computed. [2021-01-06 11:36:31,614 INFO L185 CegarLoopUtils]: At program point L100-2(lines 100 599) the Hoare annotation is: (let ((.cse30 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse31 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse14 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse22 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse18 (not .cse14)) (.cse19 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not .cse31)) (.cse10 (not .cse30)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse15 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse17 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse12 .cse17 .cse18) (and .cse8 .cse5 .cse19 .cse18) (and .cse16 .cse20) (and .cse8 .cse0 .cse14 .cse2) (and .cse3 .cse12 .cse17) (and .cse1 .cse12 .cse17) (and .cse7 .cse21 .cse1 .cse22 .cse23 .cse11 .cse2 .cse24 .cse25) (and .cse26 .cse16 .cse24 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse18) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse27 .cse26 .cse14 .cse24) (and .cse8 .cse20) (and .cse0 .cse27 .cse4 .cse5 .cse6 .cse28) (and .cse27 .cse4 .cse5 .cse6 .cse28 .cse18) (and .cse8 .cse12 .cse17 .cse18) (and .cse8 .cse14 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse7 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse21 .cse22 .cse23 .cse11 .cse2 .cse24 .cse25) (and .cse7 .cse1 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse3 .cse2) (and .cse7 .cse3 .cse11 .cse29 .cse12 .cse15) (and .cse27 .cse5 .cse16 .cse19 .cse18) (and .cse8 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse14) (and .cse0 .cse8 .cse5 .cse19) (and .cse8 .cse14 .cse30) (and .cse7 .cse3 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse14 .cse31) (and .cse7 .cse1 .cse10 .cse11 .cse29 .cse12 .cse15) (and .cse4 .cse5 .cse1 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse14 .cse15) (and .cse0 .cse8 .cse12 .cse17)))) [2021-01-06 11:36:31,615 INFO L189 CegarLoopUtils]: For program point L431-1(lines 431 439) no Hoare annotation was computed. [2021-01-06 11:36:31,615 INFO L189 CegarLoopUtils]: For program point L233(lines 233 236) no Hoare annotation was computed. [2021-01-06 11:36:31,615 INFO L185 CegarLoopUtils]: At program point L167(lines 166 559) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (not .cse3)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse3 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse3 .cse2))) [2021-01-06 11:36:31,615 INFO L185 CegarLoopUtils]: At program point L134(lines 127 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10))) [2021-01-06 11:36:31,615 INFO L189 CegarLoopUtils]: For program point L101(line 101) no Hoare annotation was computed. [2021-01-06 11:36:31,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:36:31 BoogieIcfgContainer [2021-01-06 11:36:31,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:36:31,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:36:31,671 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:36:31,672 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:36:31,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:44" (3/4) ... [2021-01-06 11:36:31,676 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 11:36:31,697 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 11:36:31,698 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 11:36:31,700 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:36:31,701 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:36:31,805 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_srvr_2.cil-1.c-witness.graphml [2021-01-06 11:36:31,805 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:36:31,806 INFO L168 Benchmark]: Toolchain (without parser) took 49248.52 ms. Allocated memory was 169.9 MB in the beginning and 1.1 GB in the end (delta: 929.0 MB). Free memory was 144.2 MB in the beginning and 521.3 MB in the end (delta: -377.2 MB). Peak memory consumption was 552.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:31,806 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 169.9 MB. Free memory is still 142.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:36:31,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 554.54 ms. Allocated memory is still 169.9 MB. Free memory was 144.0 MB in the beginning and 128.8 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:31,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.29 ms. Allocated memory is still 169.9 MB. Free memory was 128.8 MB in the beginning and 125.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:31,807 INFO L168 Benchmark]: Boogie Preprocessor took 89.73 ms. Allocated memory is still 169.9 MB. Free memory was 125.9 MB in the beginning and 123.8 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:36:31,808 INFO L168 Benchmark]: RCFGBuilder took 1153.98 ms. Allocated memory is still 169.9 MB. Free memory was 123.8 MB in the beginning and 105.1 MB in the end (delta: 18.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:31,808 INFO L168 Benchmark]: TraceAbstraction took 47184.82 ms. Allocated memory was 169.9 MB in the beginning and 1.1 GB in the end (delta: 929.0 MB). Free memory was 104.6 MB in the beginning and 533.9 MB in the end (delta: -429.3 MB). Peak memory consumption was 619.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:31,808 INFO L168 Benchmark]: Witness Printer took 133.72 ms. Allocated memory is still 1.1 GB. Free memory was 533.9 MB in the beginning and 521.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:31,811 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 169.9 MB. Free memory is still 142.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 554.54 ms. Allocated memory is still 169.9 MB. Free memory was 144.0 MB in the beginning and 128.8 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 120.29 ms. Allocated memory is still 169.9 MB. Free memory was 128.8 MB in the beginning and 125.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 89.73 ms. Allocated memory is still 169.9 MB. Free memory was 125.9 MB in the beginning and 123.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1153.98 ms. Allocated memory is still 169.9 MB. Free memory was 123.8 MB in the beginning and 105.1 MB in the end (delta: 18.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 47184.82 ms. Allocated memory was 169.9 MB in the beginning and 1.1 GB in the end (delta: 929.0 MB). Free memory was 104.6 MB in the beginning and 533.9 MB in the end (delta: -429.3 MB). Peak memory consumption was 619.3 MB. Max. memory is 8.0 GB. * Witness Printer took 133.72 ms. Allocated memory is still 1.1 GB. Free memory was 533.9 MB in the beginning and 521.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 609]: 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: 332]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__hit == 0) && s__state <= 8576) && 8512 <= s__state) || ((((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && 8480 <= s__state) && !(s__state == 8544)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && blastFlag == 0) && 8480 <= s__state) && !(s__state == 8544)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576)) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(8496 == s__state)) && 8480 <= s__state) && !(s__state == 8544)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8673) && blastFlag <= 3) && s__state <= 8672) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(12292 == s__state)) && !(s__state == 8672)) && !(s__hit == 0)) || ((((!(s__state == 8673) && s__state <= 8672) && 8656 <= s__state) && blastFlag == 1) && !(s__state == 8672))) || (((((((blastFlag <= 2 && !(s__state == 8673)) && blastFlag <= 3) && s__state <= 8672) && 8656 <= s__state) && !(12292 == s__state)) && !(s__state == 8672)) && !(s__hit == 0))) || (((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8673)) && blastFlag <= 3) && s__state <= 8672) && 8656 <= s__state) && !(12292 == s__state)) && !(s__state == 8672))) || ((((!(s__state == 8673) && blastFlag == 0) && 8656 <= s__state) && s__state <= 8672) && !(s__state == 8672)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__hit == 0) && s__state <= 8576) && 8512 <= s__state) || ((((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576) || (((blastFlag == 0 && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657))) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && s__hit == 0) && 8512 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 8656 <= s__state) && s__state <= 8656) && !(s__hit == 0))) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__hit == 0) && s__state <= 8576)) || ((blastFlag == 0 && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || (blastFlag <= 2 && s__state <= 3)) || (((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8656))) || (((((blastFlag <= 3 && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8656)) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((((!(s__state == 8545) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && 8512 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && 8512 <= s__state)) || ((((blastFlag <= 3 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8656) && !(s__hit == 0))) || ((blastFlag <= 2 && s__state == 8528) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && 8656 <= s__state) && s__state <= 8656)) || ((blastFlag <= 2 && s__hit == 0) && 8560 == s__state)) || (((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && 8512 <= s__state)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8544)) || ((((((!(s__state == 8545) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && 8512 <= s__state)) || (((s__state <= 8672 && 8656 <= s__state) && blastFlag == 1) && !(s__state == 8657))) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && s__hit == 0) && 8512 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state <= 8640) && 8640 <= s__state) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8512 <= s__state) || ((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__hit == 0) && 8512 <= s__state)) || ((((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8512 <= s__state) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) || ((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8545)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag == 0 && s__state <= 8640) && 8640 <= s__state) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) && 8512 <= s__state) || ((((blastFlag == 1 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((blastFlag == 0 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8545)) && 8480 <= s__state) && !(s__state == 8480)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) && !(s__state == 8481)) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag == 0) && 8480 <= s__state) && !(s__state == 8480)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481))) || ((((((((!(s__state == 8545) && 8480 <= s__state) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576) || (((blastFlag == 0 && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657))) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && s__hit == 0) && 8512 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 8656 <= s__state) && s__state <= 8656) && !(s__hit == 0))) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__hit == 0) && s__state <= 8576)) || ((blastFlag == 0 && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || (blastFlag <= 2 && s__state <= 3)) || (((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8656))) || (((((blastFlag <= 3 && s__state <= 8672) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8656)) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((((!(s__state == 8545) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && 8512 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && 8512 <= s__state)) || ((((blastFlag <= 3 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8656) && !(s__hit == 0))) || ((blastFlag <= 2 && s__state == 8528) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && 8656 <= s__state) && s__state <= 8656)) || ((blastFlag <= 2 && s__hit == 0) && 8560 == s__state)) || (((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8561)) && s__state <= 8640) && s__state == 8608) && 8512 <= s__state)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8544)) || ((((((!(s__state == 8545) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && 8512 <= s__state)) || (((s__state <= 8672 && 8656 <= s__state) && blastFlag == 1) && !(s__state == 8657))) || (((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && s__state <= 8640) && s__hit == 0) && 8512 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state <= 8640) && 8640 <= s__state) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8512 <= s__state) || ((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && s__hit == 0) && 8512 <= s__state)) || ((((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8512 <= s__state) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && s__state <= 8576) && 8512 <= s__state) || ((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && s__state <= 8576) && 8512 <= s__state)) || (((((!(s__state == 8545) && blastFlag <= 2) && !(s__state == 8544)) && s__hit == 0) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || (((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag <= 2) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && blastFlag == 1) && 8448 <= s__state) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8448) && 8448 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8545) && !(8496 == s__state)) && 8480 <= s__state) && !(s__state == 8480)) && !(s__state == 8544)) && s__s3__tmp__next_state___0 <= 8640) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && !(s__state == 8481)) || ((((((((((!(s__state == 8545) && blastFlag <= 2) && !(8496 == s__state)) && 8480 <= s__state) && !(s__state == 8480)) && !(s__state == 8544)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && !(s__state == 8481)) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) && 8512 <= s__state) || ((((blastFlag == 1 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((blastFlag == 0 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8656 <= s__state) && !(s__state == 8657)) && !(12292 == s__state)) && !(s__state == 8656)) || (((((blastFlag <= 3 && 8656 <= s__state) && !(s__state == 8657)) && !(12292 == s__state)) && !(s__state == 8656)) && !(s__hit == 0))) || ((((8656 <= s__state && blastFlag == 1) && !(s__state == 8657)) && !(12292 == s__state)) && !(s__state == 8656))) || ((((blastFlag == 0 && 8656 <= s__state) && !(s__state == 8657)) && !(12292 == s__state)) && !(s__state == 8656)) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) && 8512 <= s__state) || ((((blastFlag == 1 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((blastFlag == 0 && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__hit == 0) && s__state <= 8576) && 8512 <= s__state) || ((((((!(s__state == 8545) && blastFlag == 0) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state)) || ((((((!(s__state == 8545) && !(s__state == 8544)) && blastFlag == 1) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8512 <= s__state) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state == 8608) && s__hit == 0) || (blastFlag == 0 && s__state == 8608)) || (blastFlag == 1 && s__state == 8608) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 24.4s, OverallIterations: 39, TraceHistogramMax: 24, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7382 SDtfs, 4553 SDslu, 3427 SDs, 0 SdLazy, 3933 SolverSat, 1076 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3121 GetRequests, 3066 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5055occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 39 MinimizatonAttempts, 6779 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 260 NumberOfFragments, 2695 HoareAnnotationTreeSize, 28 FomulaSimplifications, 471743 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 28 FomulaSimplificationsInter, 65500 FormulaSimplificationTreeSizeReductionInter, 19.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 11577 NumberOfCodeBlocks, 11577 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 11530 ConstructedInterpolants, 0 QuantifiedInterpolants, 5297671 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5044 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 47 InterpolantComputations, 35 PerfectInterpolantSequences, 44574/44754 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...