/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_11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:41:38,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:41:38,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:41:38,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:41:38,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:41:38,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:41:38,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:41:38,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:41:38,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:41:38,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:41:38,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:41:38,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:41:38,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:41:38,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:41:38,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:41:38,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:41:38,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:41:38,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:41:38,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:41:38,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:41:38,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:41:38,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:41:38,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:41:38,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:41:38,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:41:38,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:41:38,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:41:38,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:41:38,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:41:38,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:41:38,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:41:38,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:41:38,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:41:38,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:41:38,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:41:38,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:41:38,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:41:38,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:41:38,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:41:38,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:41:38,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:41:38,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 01:41:38,718 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:41:38,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:41:38,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:41:38,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:41:38,724 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:41:38,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:41:38,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:41:38,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:41:38,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:41:38,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:41:38,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:41:38,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:41:38,727 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:41:38,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:41:38,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:41:38,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:41:38,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:41:38,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:41:38,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:41:38,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:41:38,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:41:38,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:41:38,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:41:38,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:41:38,732 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:41:38,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 01:41:39,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:41:39,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:41:39,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:41:39,147 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:41:39,148 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:41:39,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_11.cil.c [2020-12-23 01:41:39,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/921ac193d/7f848a6e2e574963bfa1f9b1b93ad005/FLAGa7c56fa5e [2020-12-23 01:41:40,025 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:41:40,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_11.cil.c [2020-12-23 01:41:40,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/921ac193d/7f848a6e2e574963bfa1f9b1b93ad005/FLAGa7c56fa5e [2020-12-23 01:41:40,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/921ac193d/7f848a6e2e574963bfa1f9b1b93ad005 [2020-12-23 01:41:40,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:41:40,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:41:40,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:41:40,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:41:40,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:41:40,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:40" (1/1) ... [2020-12-23 01:41:40,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f7006e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40, skipping insertion in model container [2020-12-23 01:41:40,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:40" (1/1) ... [2020-12-23 01:41:40,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:41:40,492 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[~s__s3__tmp__new_cipher__algorithms~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[~s__s3__tmp__new_cipher__algorithms~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[~s__s3__tmp__new_cipher__algo_strength~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__new_cipher__algo_strength~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[~s__s3__tmp__new_cipher__algorithms~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,] [2020-12-23 01:41:40,872 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_11.cil.c[43168,43181] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2020-12-23 01:41:40,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:41:40,899 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[~s__s3__tmp__new_cipher__algorithms~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[~s__s3__tmp__new_cipher__algorithms~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[~s__s3__tmp__new_cipher__algo_strength~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__new_cipher__algo_strength~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[~s__s3__tmp__new_cipher__algorithms~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,] [2020-12-23 01:41:40,970 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_11.cil.c[43168,43181] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2020-12-23 01:41:40,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:41:40,992 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:41:40,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40 WrapperNode [2020-12-23 01:41:40,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:41:40,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:41:40,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:41:40,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:41:41,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40" (1/1) ... [2020-12-23 01:41:41,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40" (1/1) ... [2020-12-23 01:41:41,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:41:41,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:41:41,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:41:41,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:41:41,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40" (1/1) ... [2020-12-23 01:41:41,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40" (1/1) ... [2020-12-23 01:41:41,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40" (1/1) ... [2020-12-23 01:41:41,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40" (1/1) ... [2020-12-23 01:41:41,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40" (1/1) ... [2020-12-23 01:41:41,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40" (1/1) ... [2020-12-23 01:41:41,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40" (1/1) ... [2020-12-23 01:41:41,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:41:41,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:41:41,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:41:41,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:41:41,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:41:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:41:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:41:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:41:41,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:41:41,410 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:41:42,138 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2020-12-23 01:41:42,138 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2020-12-23 01:41:42,151 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:41:42,151 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:41:42,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:42 BoogieIcfgContainer [2020-12-23 01:41:42,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:41:42,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:41:42,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:41:42,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:41:42,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:41:40" (1/3) ... [2020-12-23 01:41:42,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216cad91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:41:42, skipping insertion in model container [2020-12-23 01:41:42,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:40" (2/3) ... [2020-12-23 01:41:42,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216cad91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:41:42, skipping insertion in model container [2020-12-23 01:41:42,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:42" (3/3) ... [2020-12-23 01:41:42,164 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_11.cil.c [2020-12-23 01:41:42,171 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:41:42,176 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:41:42,197 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:41:42,227 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:41:42,228 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:41:42,228 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:41:42,228 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:41:42,228 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:41:42,229 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:41:42,229 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:41:42,229 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:41:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2020-12-23 01:41:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 01:41:42,258 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:42,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:42,259 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:42,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash -814657320, now seen corresponding path program 1 times [2020-12-23 01:41:42,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:42,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582574925] [2020-12-23 01:41:42,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:42,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582574925] [2020-12-23 01:41:42,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:42,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:42,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394334164] [2020-12-23 01:41:42,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:42,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:42,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:42,601 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2020-12-23 01:41:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:42,944 INFO L93 Difference]: Finished difference Result 316 states and 542 transitions. [2020-12-23 01:41:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:42,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-12-23 01:41:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:42,965 INFO L225 Difference]: With dead ends: 316 [2020-12-23 01:41:42,965 INFO L226 Difference]: Without dead ends: 155 [2020-12-23 01:41:42,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-12-23 01:41:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2020-12-23 01:41:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-12-23 01:41:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 241 transitions. [2020-12-23 01:41:43,055 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 241 transitions. Word has length 26 [2020-12-23 01:41:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:43,055 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 241 transitions. [2020-12-23 01:41:43,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 241 transitions. [2020-12-23 01:41:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:41:43,059 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:43,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:43,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:41:43,061 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:43,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:43,064 INFO L82 PathProgramCache]: Analyzing trace with hash 327844106, now seen corresponding path program 1 times [2020-12-23 01:41:43,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:43,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489297369] [2020-12-23 01:41:43,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:43,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489297369] [2020-12-23 01:41:43,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:43,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:43,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917410004] [2020-12-23 01:41:43,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:43,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:43,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:43,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:43,193 INFO L87 Difference]: Start difference. First operand 153 states and 241 transitions. Second operand 3 states. [2020-12-23 01:41:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:43,324 INFO L93 Difference]: Finished difference Result 319 states and 502 transitions. [2020-12-23 01:41:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:43,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 01:41:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:43,327 INFO L225 Difference]: With dead ends: 319 [2020-12-23 01:41:43,327 INFO L226 Difference]: Without dead ends: 174 [2020-12-23 01:41:43,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-23 01:41:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-12-23 01:41:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-12-23 01:41:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 270 transitions. [2020-12-23 01:41:43,342 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 270 transitions. Word has length 27 [2020-12-23 01:41:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:43,343 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 270 transitions. [2020-12-23 01:41:43,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 270 transitions. [2020-12-23 01:41:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:41:43,344 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:43,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:43,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:41:43,345 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:43,346 INFO L82 PathProgramCache]: Analyzing trace with hash 883966207, now seen corresponding path program 1 times [2020-12-23 01:41:43,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:43,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726062104] [2020-12-23 01:41:43,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:43,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726062104] [2020-12-23 01:41:43,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:43,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:43,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002000561] [2020-12-23 01:41:43,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:43,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:43,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:43,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:43,408 INFO L87 Difference]: Start difference. First operand 174 states and 270 transitions. Second operand 3 states. [2020-12-23 01:41:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:43,550 INFO L93 Difference]: Finished difference Result 348 states and 542 transitions. [2020-12-23 01:41:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:43,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 01:41:43,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:43,553 INFO L225 Difference]: With dead ends: 348 [2020-12-23 01:41:43,553 INFO L226 Difference]: Without dead ends: 182 [2020-12-23 01:41:43,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-12-23 01:41:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2020-12-23 01:41:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-12-23 01:41:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 281 transitions. [2020-12-23 01:41:43,568 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 281 transitions. Word has length 27 [2020-12-23 01:41:43,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:43,568 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 281 transitions. [2020-12-23 01:41:43,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 281 transitions. [2020-12-23 01:41:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:41:43,570 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:43,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:43,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:41:43,571 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:43,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1794489921, now seen corresponding path program 1 times [2020-12-23 01:41:43,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:43,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465333241] [2020-12-23 01:41:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:43,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465333241] [2020-12-23 01:41:43,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:43,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:43,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114282069] [2020-12-23 01:41:43,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:43,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:43,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:43,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:43,626 INFO L87 Difference]: Start difference. First operand 180 states and 281 transitions. Second operand 3 states. [2020-12-23 01:41:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:43,788 INFO L93 Difference]: Finished difference Result 353 states and 552 transitions. [2020-12-23 01:41:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:43,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 01:41:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:43,790 INFO L225 Difference]: With dead ends: 353 [2020-12-23 01:41:43,791 INFO L226 Difference]: Without dead ends: 181 [2020-12-23 01:41:43,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-12-23 01:41:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-12-23 01:41:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-12-23 01:41:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 282 transitions. [2020-12-23 01:41:43,804 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 282 transitions. Word has length 27 [2020-12-23 01:41:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:43,805 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 282 transitions. [2020-12-23 01:41:43,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 282 transitions. [2020-12-23 01:41:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 01:41:43,807 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:43,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:43,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:41:43,808 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:43,808 INFO L82 PathProgramCache]: Analyzing trace with hash -594155684, now seen corresponding path program 1 times [2020-12-23 01:41:43,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:43,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871551341] [2020-12-23 01:41:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:43,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871551341] [2020-12-23 01:41:43,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:43,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:43,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781683542] [2020-12-23 01:41:43,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:43,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:43,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:43,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:43,862 INFO L87 Difference]: Start difference. First operand 181 states and 282 transitions. Second operand 3 states. [2020-12-23 01:41:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:44,001 INFO L93 Difference]: Finished difference Result 364 states and 564 transitions. [2020-12-23 01:41:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:44,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-23 01:41:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:44,004 INFO L225 Difference]: With dead ends: 364 [2020-12-23 01:41:44,004 INFO L226 Difference]: Without dead ends: 191 [2020-12-23 01:41:44,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-23 01:41:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2020-12-23 01:41:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-12-23 01:41:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 280 transitions. [2020-12-23 01:41:44,016 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 280 transitions. Word has length 28 [2020-12-23 01:41:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:44,017 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 280 transitions. [2020-12-23 01:41:44,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 280 transitions. [2020-12-23 01:41:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:41:44,021 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:44,021 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] [2020-12-23 01:41:44,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:41:44,022 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1519140995, now seen corresponding path program 1 times [2020-12-23 01:41:44,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:44,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775733160] [2020-12-23 01:41:44,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:44,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775733160] [2020-12-23 01:41:44,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:44,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:44,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880170661] [2020-12-23 01:41:44,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:44,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:44,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:44,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:44,114 INFO L87 Difference]: Start difference. First operand 181 states and 280 transitions. Second operand 3 states. [2020-12-23 01:41:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:44,242 INFO L93 Difference]: Finished difference Result 364 states and 560 transitions. [2020-12-23 01:41:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:44,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-12-23 01:41:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:44,244 INFO L225 Difference]: With dead ends: 364 [2020-12-23 01:41:44,244 INFO L226 Difference]: Without dead ends: 191 [2020-12-23 01:41:44,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-23 01:41:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2020-12-23 01:41:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-12-23 01:41:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 278 transitions. [2020-12-23 01:41:44,256 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 278 transitions. Word has length 29 [2020-12-23 01:41:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:44,257 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 278 transitions. [2020-12-23 01:41:44,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 278 transitions. [2020-12-23 01:41:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 01:41:44,263 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:44,263 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] [2020-12-23 01:41:44,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:41:44,267 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1615530751, now seen corresponding path program 1 times [2020-12-23 01:41:44,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:44,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70919065] [2020-12-23 01:41:44,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:44,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70919065] [2020-12-23 01:41:44,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:44,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:44,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117336939] [2020-12-23 01:41:44,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:44,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:44,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:44,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:44,345 INFO L87 Difference]: Start difference. First operand 181 states and 278 transitions. Second operand 3 states. [2020-12-23 01:41:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:44,476 INFO L93 Difference]: Finished difference Result 364 states and 556 transitions. [2020-12-23 01:41:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:44,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-12-23 01:41:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:44,478 INFO L225 Difference]: With dead ends: 364 [2020-12-23 01:41:44,479 INFO L226 Difference]: Without dead ends: 191 [2020-12-23 01:41:44,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-23 01:41:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2020-12-23 01:41:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-12-23 01:41:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 276 transitions. [2020-12-23 01:41:44,488 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 276 transitions. Word has length 30 [2020-12-23 01:41:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:44,488 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 276 transitions. [2020-12-23 01:41:44,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 276 transitions. [2020-12-23 01:41:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 01:41:44,489 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:44,489 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] [2020-12-23 01:41:44,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:41:44,490 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:44,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1189847454, now seen corresponding path program 1 times [2020-12-23 01:41:44,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:44,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054562209] [2020-12-23 01:41:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:44,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054562209] [2020-12-23 01:41:44,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:44,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:41:44,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514086663] [2020-12-23 01:41:44,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:41:44,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:44,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:41:44,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:41:44,551 INFO L87 Difference]: Start difference. First operand 181 states and 276 transitions. Second operand 4 states. [2020-12-23 01:41:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:44,812 INFO L93 Difference]: Finished difference Result 512 states and 779 transitions. [2020-12-23 01:41:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:41:44,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-12-23 01:41:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:44,815 INFO L225 Difference]: With dead ends: 512 [2020-12-23 01:41:44,815 INFO L226 Difference]: Without dead ends: 339 [2020-12-23 01:41:44,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-12-23 01:41:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 324. [2020-12-23 01:41:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-12-23 01:41:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 495 transitions. [2020-12-23 01:41:44,839 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 495 transitions. Word has length 30 [2020-12-23 01:41:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:44,839 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 495 transitions. [2020-12-23 01:41:44,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:41:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 495 transitions. [2020-12-23 01:41:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 01:41:44,841 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:44,842 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] [2020-12-23 01:41:44,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:41:44,842 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:44,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1632006041, now seen corresponding path program 1 times [2020-12-23 01:41:44,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:44,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572862386] [2020-12-23 01:41:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:44,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572862386] [2020-12-23 01:41:44,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:44,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:44,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307734237] [2020-12-23 01:41:44,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:44,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:44,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:44,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:44,943 INFO L87 Difference]: Start difference. First operand 324 states and 495 transitions. Second operand 3 states. [2020-12-23 01:41:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:45,152 INFO L93 Difference]: Finished difference Result 699 states and 1075 transitions. [2020-12-23 01:41:45,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:45,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-23 01:41:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:45,155 INFO L225 Difference]: With dead ends: 699 [2020-12-23 01:41:45,155 INFO L226 Difference]: Without dead ends: 383 [2020-12-23 01:41:45,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2020-12-23 01:41:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 375. [2020-12-23 01:41:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-12-23 01:41:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 582 transitions. [2020-12-23 01:41:45,194 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 582 transitions. Word has length 44 [2020-12-23 01:41:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:45,196 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 582 transitions. [2020-12-23 01:41:45,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 582 transitions. [2020-12-23 01:41:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:41:45,198 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:45,198 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] [2020-12-23 01:41:45,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:41:45,198 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:45,199 INFO L82 PathProgramCache]: Analyzing trace with hash -954576389, now seen corresponding path program 1 times [2020-12-23 01:41:45,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:45,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970273504] [2020-12-23 01:41:45,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:45,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970273504] [2020-12-23 01:41:45,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:45,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:45,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593338736] [2020-12-23 01:41:45,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:45,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:45,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:45,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:45,255 INFO L87 Difference]: Start difference. First operand 375 states and 582 transitions. Second operand 3 states. [2020-12-23 01:41:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:45,464 INFO L93 Difference]: Finished difference Result 776 states and 1211 transitions. [2020-12-23 01:41:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:45,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-23 01:41:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:45,471 INFO L225 Difference]: With dead ends: 776 [2020-12-23 01:41:45,471 INFO L226 Difference]: Without dead ends: 407 [2020-12-23 01:41:45,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2020-12-23 01:41:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 399. [2020-12-23 01:41:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-12-23 01:41:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 628 transitions. [2020-12-23 01:41:45,494 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 628 transitions. Word has length 45 [2020-12-23 01:41:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:45,495 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 628 transitions. [2020-12-23 01:41:45,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 628 transitions. [2020-12-23 01:41:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 01:41:45,496 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:45,497 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:41:45,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:41:45,497 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:45,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1426018212, now seen corresponding path program 1 times [2020-12-23 01:41:45,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:45,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105641084] [2020-12-23 01:41:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 01:41:45,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105641084] [2020-12-23 01:41:45,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:45,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:45,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474664238] [2020-12-23 01:41:45,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:45,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:45,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:45,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:45,553 INFO L87 Difference]: Start difference. First operand 399 states and 628 transitions. Second operand 3 states. [2020-12-23 01:41:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:45,742 INFO L93 Difference]: Finished difference Result 830 states and 1311 transitions. [2020-12-23 01:41:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:45,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-12-23 01:41:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:45,746 INFO L225 Difference]: With dead ends: 830 [2020-12-23 01:41:45,746 INFO L226 Difference]: Without dead ends: 439 [2020-12-23 01:41:45,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-12-23 01:41:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2020-12-23 01:41:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-12-23 01:41:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 693 transitions. [2020-12-23 01:41:45,768 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 693 transitions. Word has length 55 [2020-12-23 01:41:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:45,768 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 693 transitions. [2020-12-23 01:41:45,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 693 transitions. [2020-12-23 01:41:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 01:41:45,770 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:45,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:45,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:41:45,770 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash 961137590, now seen corresponding path program 1 times [2020-12-23 01:41:45,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:45,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655290935] [2020-12-23 01:41:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 01:41:45,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655290935] [2020-12-23 01:41:45,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:45,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:45,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656370100] [2020-12-23 01:41:45,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:45,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:45,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:45,856 INFO L87 Difference]: Start difference. First operand 439 states and 693 transitions. Second operand 3 states. [2020-12-23 01:41:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:46,041 INFO L93 Difference]: Finished difference Result 912 states and 1441 transitions. [2020-12-23 01:41:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:46,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-23 01:41:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:46,046 INFO L225 Difference]: With dead ends: 912 [2020-12-23 01:41:46,046 INFO L226 Difference]: Without dead ends: 481 [2020-12-23 01:41:46,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-12-23 01:41:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 477. [2020-12-23 01:41:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-12-23 01:41:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 753 transitions. [2020-12-23 01:41:46,069 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 753 transitions. Word has length 82 [2020-12-23 01:41:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:46,069 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 753 transitions. [2020-12-23 01:41:46,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 753 transitions. [2020-12-23 01:41:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 01:41:46,071 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:46,071 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] [2020-12-23 01:41:46,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:41:46,072 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:46,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash -986689731, now seen corresponding path program 1 times [2020-12-23 01:41:46,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:46,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411041730] [2020-12-23 01:41:46,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 01:41:46,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411041730] [2020-12-23 01:41:46,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:46,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:46,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368057511] [2020-12-23 01:41:46,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:46,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:46,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:46,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,125 INFO L87 Difference]: Start difference. First operand 477 states and 753 transitions. Second operand 3 states. [2020-12-23 01:41:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:46,304 INFO L93 Difference]: Finished difference Result 950 states and 1498 transitions. [2020-12-23 01:41:46,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:46,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2020-12-23 01:41:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:46,307 INFO L225 Difference]: With dead ends: 950 [2020-12-23 01:41:46,307 INFO L226 Difference]: Without dead ends: 481 [2020-12-23 01:41:46,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-12-23 01:41:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 477. [2020-12-23 01:41:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-12-23 01:41:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 750 transitions. [2020-12-23 01:41:46,338 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 750 transitions. Word has length 83 [2020-12-23 01:41:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:46,339 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 750 transitions. [2020-12-23 01:41:46,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 750 transitions. [2020-12-23 01:41:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:41:46,347 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:46,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:46,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:41:46,347 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:46,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:46,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1836560986, now seen corresponding path program 1 times [2020-12-23 01:41:46,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:46,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44364688] [2020-12-23 01:41:46,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 01:41:46,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44364688] [2020-12-23 01:41:46,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:46,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:46,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431944755] [2020-12-23 01:41:46,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:46,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:46,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,405 INFO L87 Difference]: Start difference. First operand 477 states and 750 transitions. Second operand 3 states. [2020-12-23 01:41:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:46,585 INFO L93 Difference]: Finished difference Result 998 states and 1573 transitions. [2020-12-23 01:41:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:46,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-12-23 01:41:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:46,589 INFO L225 Difference]: With dead ends: 998 [2020-12-23 01:41:46,589 INFO L226 Difference]: Without dead ends: 529 [2020-12-23 01:41:46,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-12-23 01:41:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 513. [2020-12-23 01:41:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-12-23 01:41:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 805 transitions. [2020-12-23 01:41:46,614 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 805 transitions. Word has length 84 [2020-12-23 01:41:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:46,614 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 805 transitions. [2020-12-23 01:41:46,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 805 transitions. [2020-12-23 01:41:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 01:41:46,616 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:46,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:46,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:41:46,617 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:46,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:46,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1112959693, now seen corresponding path program 1 times [2020-12-23 01:41:46,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:46,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260361698] [2020-12-23 01:41:46,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 01:41:46,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260361698] [2020-12-23 01:41:46,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:46,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:46,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494624700] [2020-12-23 01:41:46,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:46,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,661 INFO L87 Difference]: Start difference. First operand 513 states and 805 transitions. Second operand 3 states. [2020-12-23 01:41:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:46,838 INFO L93 Difference]: Finished difference Result 1034 states and 1624 transitions. [2020-12-23 01:41:46,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:46,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-23 01:41:46,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:46,841 INFO L225 Difference]: With dead ends: 1034 [2020-12-23 01:41:46,842 INFO L226 Difference]: Without dead ends: 529 [2020-12-23 01:41:46,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-12-23 01:41:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 513. [2020-12-23 01:41:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-12-23 01:41:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 801 transitions. [2020-12-23 01:41:46,868 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 801 transitions. Word has length 85 [2020-12-23 01:41:46,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:46,869 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 801 transitions. [2020-12-23 01:41:46,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 801 transitions. [2020-12-23 01:41:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 01:41:46,870 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:46,870 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, 1] [2020-12-23 01:41:46,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:41:46,871 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:46,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:46,872 INFO L82 PathProgramCache]: Analyzing trace with hash 167103299, now seen corresponding path program 1 times [2020-12-23 01:41:46,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:46,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200116556] [2020-12-23 01:41:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:46,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200116556] [2020-12-23 01:41:46,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:46,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:46,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658464080] [2020-12-23 01:41:46,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:46,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:46,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:46,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:46,949 INFO L87 Difference]: Start difference. First operand 513 states and 801 transitions. Second operand 3 states. [2020-12-23 01:41:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,163 INFO L93 Difference]: Finished difference Result 1079 states and 1683 transitions. [2020-12-23 01:41:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-23 01:41:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,167 INFO L225 Difference]: With dead ends: 1079 [2020-12-23 01:41:47,167 INFO L226 Difference]: Without dead ends: 574 [2020-12-23 01:41:47,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 [2020-12-23 01:41:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-12-23 01:41:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 566. [2020-12-23 01:41:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2020-12-23 01:41:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 882 transitions. [2020-12-23 01:41:47,193 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 882 transitions. Word has length 85 [2020-12-23 01:41:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,193 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 882 transitions. [2020-12-23 01:41:47,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 882 transitions. [2020-12-23 01:41:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 01:41:47,195 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,195 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, 1] [2020-12-23 01:41:47,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:41:47,195 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1767051647, now seen corresponding path program 1 times [2020-12-23 01:41:47,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908067116] [2020-12-23 01:41:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:41:47,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908067116] [2020-12-23 01:41:47,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:47,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600791869] [2020-12-23 01:41:47,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:47,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:47,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,235 INFO L87 Difference]: Start difference. First operand 566 states and 882 transitions. Second operand 3 states. [2020-12-23 01:41:47,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,442 INFO L93 Difference]: Finished difference Result 1132 states and 1762 transitions. [2020-12-23 01:41:47,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 01:41:47,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,446 INFO L225 Difference]: With dead ends: 1132 [2020-12-23 01:41:47,446 INFO L226 Difference]: Without dead ends: 572 [2020-12-23 01:41:47,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-12-23 01:41:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 564. [2020-12-23 01:41:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2020-12-23 01:41:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 877 transitions. [2020-12-23 01:41:47,472 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 877 transitions. Word has length 86 [2020-12-23 01:41:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,472 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 877 transitions. [2020-12-23 01:41:47,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 877 transitions. [2020-12-23 01:41:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 01:41:47,474 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,474 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, 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] [2020-12-23 01:41:47,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:41:47,475 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1128064849, now seen corresponding path program 1 times [2020-12-23 01:41:47,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402750479] [2020-12-23 01:41:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-23 01:41:47,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402750479] [2020-12-23 01:41:47,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:47,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630508656] [2020-12-23 01:41:47,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:47,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:47,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,529 INFO L87 Difference]: Start difference. First operand 564 states and 877 transitions. Second operand 3 states. [2020-12-23 01:41:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,694 INFO L93 Difference]: Finished difference Result 1160 states and 1805 transitions. [2020-12-23 01:41:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 01:41:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,698 INFO L225 Difference]: With dead ends: 1160 [2020-12-23 01:41:47,698 INFO L226 Difference]: Without dead ends: 604 [2020-12-23 01:41:47,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-12-23 01:41:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 594. [2020-12-23 01:41:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-23 01:41:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 918 transitions. [2020-12-23 01:41:47,727 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 918 transitions. Word has length 107 [2020-12-23 01:41:47,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,727 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 918 transitions. [2020-12-23 01:41:47,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 918 transitions. [2020-12-23 01:41:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 01:41:47,729 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,729 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, 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] [2020-12-23 01:41:47,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:41:47,730 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,730 INFO L82 PathProgramCache]: Analyzing trace with hash 56241544, now seen corresponding path program 1 times [2020-12-23 01:41:47,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083311638] [2020-12-23 01:41:47,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-23 01:41:47,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083311638] [2020-12-23 01:41:47,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:47,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:47,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102628979] [2020-12-23 01:41:47,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:47,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:47,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:47,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,770 INFO L87 Difference]: Start difference. First operand 594 states and 918 transitions. Second operand 3 states. [2020-12-23 01:41:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:47,949 INFO L93 Difference]: Finished difference Result 1190 states and 1840 transitions. [2020-12-23 01:41:47,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:47,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2020-12-23 01:41:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:47,953 INFO L225 Difference]: With dead ends: 1190 [2020-12-23 01:41:47,953 INFO L226 Difference]: Without dead ends: 604 [2020-12-23 01:41:47,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-12-23 01:41:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 594. [2020-12-23 01:41:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-23 01:41:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 912 transitions. [2020-12-23 01:41:47,986 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 912 transitions. Word has length 108 [2020-12-23 01:41:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:47,986 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 912 transitions. [2020-12-23 01:41:47,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 912 transitions. [2020-12-23 01:41:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 01:41:47,988 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:47,988 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:47,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:41:47,989 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:47,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:47,989 INFO L82 PathProgramCache]: Analyzing trace with hash -296831400, now seen corresponding path program 1 times [2020-12-23 01:41:47,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:47,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431864598] [2020-12-23 01:41:47,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-12-23 01:41:48,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431864598] [2020-12-23 01:41:48,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:48,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:48,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693116547] [2020-12-23 01:41:48,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:48,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:48,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:48,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,061 INFO L87 Difference]: Start difference. First operand 594 states and 912 transitions. Second operand 3 states. [2020-12-23 01:41:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:48,244 INFO L93 Difference]: Finished difference Result 1240 states and 1907 transitions. [2020-12-23 01:41:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:48,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-12-23 01:41:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:48,248 INFO L225 Difference]: With dead ends: 1240 [2020-12-23 01:41:48,248 INFO L226 Difference]: Without dead ends: 654 [2020-12-23 01:41:48,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2020-12-23 01:41:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 628. [2020-12-23 01:41:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-12-23 01:41:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 959 transitions. [2020-12-23 01:41:48,281 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 959 transitions. Word has length 111 [2020-12-23 01:41:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:48,281 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 959 transitions. [2020-12-23 01:41:48,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 959 transitions. [2020-12-23 01:41:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 01:41:48,283 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:48,284 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:41:48,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:41:48,284 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:48,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1499138703, now seen corresponding path program 1 times [2020-12-23 01:41:48,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:48,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095288550] [2020-12-23 01:41:48,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-12-23 01:41:48,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095288550] [2020-12-23 01:41:48,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:48,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:48,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298022898] [2020-12-23 01:41:48,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:48,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:48,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:48,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,332 INFO L87 Difference]: Start difference. First operand 628 states and 959 transitions. Second operand 3 states. [2020-12-23 01:41:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:48,515 INFO L93 Difference]: Finished difference Result 1274 states and 1948 transitions. [2020-12-23 01:41:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:48,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2020-12-23 01:41:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:48,519 INFO L225 Difference]: With dead ends: 1274 [2020-12-23 01:41:48,519 INFO L226 Difference]: Without dead ends: 654 [2020-12-23 01:41:48,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2020-12-23 01:41:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 628. [2020-12-23 01:41:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-12-23 01:41:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 953 transitions. [2020-12-23 01:41:48,550 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 953 transitions. Word has length 112 [2020-12-23 01:41:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:48,550 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 953 transitions. [2020-12-23 01:41:48,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 953 transitions. [2020-12-23 01:41:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-23 01:41:48,552 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:48,552 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, 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] [2020-12-23 01:41:48,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:41:48,553 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:48,553 INFO L82 PathProgramCache]: Analyzing trace with hash 657079250, now seen corresponding path program 1 times [2020-12-23 01:41:48,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:48,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232320906] [2020-12-23 01:41:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-23 01:41:48,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232320906] [2020-12-23 01:41:48,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:48,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:48,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962454125] [2020-12-23 01:41:48,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:48,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:48,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:48,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,616 INFO L87 Difference]: Start difference. First operand 628 states and 953 transitions. Second operand 3 states. [2020-12-23 01:41:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:48,862 INFO L93 Difference]: Finished difference Result 1301 states and 1973 transitions. [2020-12-23 01:41:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:48,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2020-12-23 01:41:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:48,868 INFO L225 Difference]: With dead ends: 1301 [2020-12-23 01:41:48,868 INFO L226 Difference]: Without dead ends: 681 [2020-12-23 01:41:48,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2020-12-23 01:41:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 675. [2020-12-23 01:41:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2020-12-23 01:41:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1021 transitions. [2020-12-23 01:41:48,913 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1021 transitions. Word has length 123 [2020-12-23 01:41:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:48,913 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 1021 transitions. [2020-12-23 01:41:48,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1021 transitions. [2020-12-23 01:41:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 01:41:48,917 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:48,917 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:48,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:41:48,918 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:48,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:48,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1371731480, now seen corresponding path program 1 times [2020-12-23 01:41:48,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:48,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836790732] [2020-12-23 01:41:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:41:48,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836790732] [2020-12-23 01:41:48,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:48,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:48,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476069808] [2020-12-23 01:41:48,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:48,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:48,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:48,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:48,998 INFO L87 Difference]: Start difference. First operand 675 states and 1021 transitions. Second operand 3 states. [2020-12-23 01:41:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:49,096 INFO L93 Difference]: Finished difference Result 1344 states and 2031 transitions. [2020-12-23 01:41:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:49,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2020-12-23 01:41:49,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:49,104 INFO L225 Difference]: With dead ends: 1344 [2020-12-23 01:41:49,104 INFO L226 Difference]: Without dead ends: 1342 [2020-12-23 01:41:49,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2020-12-23 01:41:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1340. [2020-12-23 01:41:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2020-12-23 01:41:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 2027 transitions. [2020-12-23 01:41:49,170 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 2027 transitions. Word has length 124 [2020-12-23 01:41:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:49,171 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 2027 transitions. [2020-12-23 01:41:49,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 2027 transitions. [2020-12-23 01:41:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-23 01:41:49,174 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:49,175 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:49,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:41:49,175 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:49,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:49,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1920674126, now seen corresponding path program 1 times [2020-12-23 01:41:49,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:49,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214275815] [2020-12-23 01:41:49,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-23 01:41:49,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214275815] [2020-12-23 01:41:49,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911925690] [2020-12-23 01:41:49,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,267 INFO L87 Difference]: Start difference. First operand 1340 states and 2027 transitions. Second operand 3 states. [2020-12-23 01:41:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:49,385 INFO L93 Difference]: Finished difference Result 3329 states and 5035 transitions. [2020-12-23 01:41:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:49,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-12-23 01:41:49,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:49,397 INFO L225 Difference]: With dead ends: 3329 [2020-12-23 01:41:49,397 INFO L226 Difference]: Without dead ends: 1997 [2020-12-23 01:41:49,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2020-12-23 01:41:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1995. [2020-12-23 01:41:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2020-12-23 01:41:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 3013 transitions. [2020-12-23 01:41:49,501 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 3013 transitions. Word has length 125 [2020-12-23 01:41:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:49,501 INFO L481 AbstractCegarLoop]: Abstraction has 1995 states and 3013 transitions. [2020-12-23 01:41:49,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 3013 transitions. [2020-12-23 01:41:49,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-23 01:41:49,505 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:49,506 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:49,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:41:49,506 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:49,507 INFO L82 PathProgramCache]: Analyzing trace with hash 232432692, now seen corresponding path program 1 times [2020-12-23 01:41:49,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:49,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163298290] [2020-12-23 01:41:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-23 01:41:49,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163298290] [2020-12-23 01:41:49,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734259534] [2020-12-23 01:41:49,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,552 INFO L87 Difference]: Start difference. First operand 1995 states and 3013 transitions. Second operand 3 states. [2020-12-23 01:41:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:49,689 INFO L93 Difference]: Finished difference Result 4617 states and 6972 transitions. [2020-12-23 01:41:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:49,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-12-23 01:41:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:49,722 INFO L225 Difference]: With dead ends: 4617 [2020-12-23 01:41:49,723 INFO L226 Difference]: Without dead ends: 2630 [2020-12-23 01:41:49,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2020-12-23 01:41:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2628. [2020-12-23 01:41:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2628 states. [2020-12-23 01:41:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 3962 transitions. [2020-12-23 01:41:49,841 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 3962 transitions. Word has length 125 [2020-12-23 01:41:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:49,841 INFO L481 AbstractCegarLoop]: Abstraction has 2628 states and 3962 transitions. [2020-12-23 01:41:49,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 3962 transitions. [2020-12-23 01:41:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 01:41:49,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:49,846 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:49,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:41:49,846 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:49,847 INFO L82 PathProgramCache]: Analyzing trace with hash 357624272, now seen corresponding path program 1 times [2020-12-23 01:41:49,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:49,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755814024] [2020-12-23 01:41:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-12-23 01:41:49,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755814024] [2020-12-23 01:41:49,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:49,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:49,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813303956] [2020-12-23 01:41:49,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:49,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:49,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:49,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:49,894 INFO L87 Difference]: Start difference. First operand 2628 states and 3962 transitions. Second operand 3 states. [2020-12-23 01:41:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:50,144 INFO L93 Difference]: Finished difference Result 5376 states and 8099 transitions. [2020-12-23 01:41:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:50,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 01:41:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:50,159 INFO L225 Difference]: With dead ends: 5376 [2020-12-23 01:41:50,160 INFO L226 Difference]: Without dead ends: 2756 [2020-12-23 01:41:50,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2020-12-23 01:41:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 2724. [2020-12-23 01:41:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2724 states. [2020-12-23 01:41:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 4077 transitions. [2020-12-23 01:41:50,318 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 4077 transitions. Word has length 133 [2020-12-23 01:41:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:50,318 INFO L481 AbstractCegarLoop]: Abstraction has 2724 states and 4077 transitions. [2020-12-23 01:41:50,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 4077 transitions. [2020-12-23 01:41:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 01:41:50,323 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:50,324 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:50,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:41:50,324 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:50,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1875401929, now seen corresponding path program 1 times [2020-12-23 01:41:50,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:50,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088133372] [2020-12-23 01:41:50,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-12-23 01:41:50,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088133372] [2020-12-23 01:41:50,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:50,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:50,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577922409] [2020-12-23 01:41:50,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:50,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:50,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,376 INFO L87 Difference]: Start difference. First operand 2724 states and 4077 transitions. Second operand 3 states. [2020-12-23 01:41:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:50,661 INFO L93 Difference]: Finished difference Result 5472 states and 8182 transitions. [2020-12-23 01:41:50,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:50,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-12-23 01:41:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:50,677 INFO L225 Difference]: With dead ends: 5472 [2020-12-23 01:41:50,677 INFO L226 Difference]: Without dead ends: 2756 [2020-12-23 01:41:50,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2020-12-23 01:41:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 2724. [2020-12-23 01:41:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2724 states. [2020-12-23 01:41:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 4045 transitions. [2020-12-23 01:41:50,851 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 4045 transitions. Word has length 134 [2020-12-23 01:41:50,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:50,851 INFO L481 AbstractCegarLoop]: Abstraction has 2724 states and 4045 transitions. [2020-12-23 01:41:50,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 4045 transitions. [2020-12-23 01:41:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-23 01:41:50,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:50,856 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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] [2020-12-23 01:41:50,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 01:41:50,857 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:50,857 INFO L82 PathProgramCache]: Analyzing trace with hash 214407641, now seen corresponding path program 1 times [2020-12-23 01:41:50,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:50,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249241793] [2020-12-23 01:41:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-12-23 01:41:50,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249241793] [2020-12-23 01:41:50,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:50,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:50,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749222828] [2020-12-23 01:41:50,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:50,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:50,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:50,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:50,913 INFO L87 Difference]: Start difference. First operand 2724 states and 4045 transitions. Second operand 3 states. [2020-12-23 01:41:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:51,183 INFO L93 Difference]: Finished difference Result 5522 states and 8175 transitions. [2020-12-23 01:41:51,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:51,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2020-12-23 01:41:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:51,197 INFO L225 Difference]: With dead ends: 5522 [2020-12-23 01:41:51,197 INFO L226 Difference]: Without dead ends: 2806 [2020-12-23 01:41:51,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2020-12-23 01:41:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2724. [2020-12-23 01:41:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2724 states. [2020-12-23 01:41:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 3957 transitions. [2020-12-23 01:41:51,359 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 3957 transitions. Word has length 164 [2020-12-23 01:41:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:51,360 INFO L481 AbstractCegarLoop]: Abstraction has 2724 states and 3957 transitions. [2020-12-23 01:41:51,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3957 transitions. [2020-12-23 01:41:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-23 01:41:51,365 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:51,365 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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] [2020-12-23 01:41:51,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:41:51,366 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:51,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:51,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1161445527, now seen corresponding path program 1 times [2020-12-23 01:41:51,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:51,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924357921] [2020-12-23 01:41:51,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-12-23 01:41:51,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924357921] [2020-12-23 01:41:51,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:51,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:51,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545514921] [2020-12-23 01:41:51,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:51,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:51,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:51,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:51,449 INFO L87 Difference]: Start difference. First operand 2724 states and 3957 transitions. Second operand 3 states. [2020-12-23 01:41:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:51,774 INFO L93 Difference]: Finished difference Result 5712 states and 8274 transitions. [2020-12-23 01:41:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:51,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2020-12-23 01:41:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:51,790 INFO L225 Difference]: With dead ends: 5712 [2020-12-23 01:41:51,790 INFO L226 Difference]: Without dead ends: 2996 [2020-12-23 01:41:51,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2020-12-23 01:41:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2840. [2020-12-23 01:41:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2840 states. [2020-12-23 01:41:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 4045 transitions. [2020-12-23 01:41:51,919 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 4045 transitions. Word has length 164 [2020-12-23 01:41:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:51,919 INFO L481 AbstractCegarLoop]: Abstraction has 2840 states and 4045 transitions. [2020-12-23 01:41:51,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 4045 transitions. [2020-12-23 01:41:51,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-23 01:41:51,925 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:51,925 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:51,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 01:41:51,925 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:51,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:51,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2016709837, now seen corresponding path program 1 times [2020-12-23 01:41:51,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:51,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172149111] [2020-12-23 01:41:51,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:41:52,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172149111] [2020-12-23 01:41:52,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031957510] [2020-12-23 01:41:52,026 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 [2020-12-23 01:41:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:52,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:41:52,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:41:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2020-12-23 01:41:52,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:41:52,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 01:41:52,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623884319] [2020-12-23 01:41:52,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:52,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:52,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:52,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:52,648 INFO L87 Difference]: Start difference. First operand 2840 states and 4045 transitions. Second operand 3 states. [2020-12-23 01:41:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:52,847 INFO L93 Difference]: Finished difference Result 8485 states and 12072 transitions. [2020-12-23 01:41:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:52,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2020-12-23 01:41:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:52,866 INFO L225 Difference]: With dead ends: 8485 [2020-12-23 01:41:52,866 INFO L226 Difference]: Without dead ends: 5653 [2020-12-23 01:41:52,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:52,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5653 states. [2020-12-23 01:41:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5653 to 5651. [2020-12-23 01:41:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5651 states. [2020-12-23 01:41:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5651 states to 5651 states and 8034 transitions. [2020-12-23 01:41:53,126 INFO L78 Accepts]: Start accepts. Automaton has 5651 states and 8034 transitions. Word has length 172 [2020-12-23 01:41:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:53,127 INFO L481 AbstractCegarLoop]: Abstraction has 5651 states and 8034 transitions. [2020-12-23 01:41:53,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 5651 states and 8034 transitions. [2020-12-23 01:41:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-23 01:41:53,136 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:53,136 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:53,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:41:53,352 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:53,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash 594356241, now seen corresponding path program 1 times [2020-12-23 01:41:53,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:53,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228416010] [2020-12-23 01:41:53,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:41:53,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228416010] [2020-12-23 01:41:53,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414339816] [2020-12-23 01:41:53,430 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 [2020-12-23 01:41:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:53,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 01:41:53,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:41:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2020-12-23 01:41:53,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:41:53,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 01:41:53,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966462829] [2020-12-23 01:41:53,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:53,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:53,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:53,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:53,741 INFO L87 Difference]: Start difference. First operand 5651 states and 8034 transitions. Second operand 3 states. [2020-12-23 01:41:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:54,227 INFO L93 Difference]: Finished difference Result 11837 states and 16799 transitions. [2020-12-23 01:41:54,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:54,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2020-12-23 01:41:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:54,244 INFO L225 Difference]: With dead ends: 11837 [2020-12-23 01:41:54,244 INFO L226 Difference]: Without dead ends: 5995 [2020-12-23 01:41:54,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-12-23 01:41:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 5835. [2020-12-23 01:41:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5835 states. [2020-12-23 01:41:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5835 states to 5835 states and 8266 transitions. [2020-12-23 01:41:54,489 INFO L78 Accepts]: Start accepts. Automaton has 5835 states and 8266 transitions. Word has length 173 [2020-12-23 01:41:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:54,489 INFO L481 AbstractCegarLoop]: Abstraction has 5835 states and 8266 transitions. [2020-12-23 01:41:54,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5835 states and 8266 transitions. [2020-12-23 01:41:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-12-23 01:41:54,498 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:54,498 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:54,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:41:54,712 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1057591537, now seen corresponding path program 1 times [2020-12-23 01:41:54,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:54,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020872359] [2020-12-23 01:41:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 130 proven. 6 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:41:54,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020872359] [2020-12-23 01:41:54,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849468766] [2020-12-23 01:41:54,878 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 [2020-12-23 01:41:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:55,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 01:41:55,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:41:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2020-12-23 01:41:55,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:41:55,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 01:41:55,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590045600] [2020-12-23 01:41:55,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:55,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:55,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:55,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:55,218 INFO L87 Difference]: Start difference. First operand 5835 states and 8266 transitions. Second operand 3 states. [2020-12-23 01:41:55,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:55,602 INFO L93 Difference]: Finished difference Result 10594 states and 14958 transitions. [2020-12-23 01:41:55,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:55,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-12-23 01:41:55,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:55,616 INFO L225 Difference]: With dead ends: 10594 [2020-12-23 01:41:55,616 INFO L226 Difference]: Without dead ends: 4616 [2020-12-23 01:41:55,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4616 states. [2020-12-23 01:41:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4616 to 4472. [2020-12-23 01:41:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4472 states. [2020-12-23 01:41:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4472 states to 4472 states and 6325 transitions. [2020-12-23 01:41:55,805 INFO L78 Accepts]: Start accepts. Automaton has 4472 states and 6325 transitions. Word has length 174 [2020-12-23 01:41:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:55,805 INFO L481 AbstractCegarLoop]: Abstraction has 4472 states and 6325 transitions. [2020-12-23 01:41:55,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4472 states and 6325 transitions. [2020-12-23 01:41:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-23 01:41:55,812 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:55,812 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:56,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:41:56,028 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:56,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:56,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1886384411, now seen corresponding path program 1 times [2020-12-23 01:41:56,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:56,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17167838] [2020-12-23 01:41:56,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-12-23 01:41:56,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17167838] [2020-12-23 01:41:56,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893304680] [2020-12-23 01:41:56,161 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 [2020-12-23 01:41:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:56,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 01:41:56,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:41:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2020-12-23 01:41:56,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:41:56,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2020-12-23 01:41:56,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258349704] [2020-12-23 01:41:56,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:56,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:56,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:56,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:41:56,443 INFO L87 Difference]: Start difference. First operand 4472 states and 6325 transitions. Second operand 3 states. [2020-12-23 01:41:56,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:56,630 INFO L93 Difference]: Finished difference Result 8871 states and 12552 transitions. [2020-12-23 01:41:56,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:56,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-12-23 01:41:56,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:56,643 INFO L225 Difference]: With dead ends: 8871 [2020-12-23 01:41:56,643 INFO L226 Difference]: Without dead ends: 4474 [2020-12-23 01:41:56,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:41:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2020-12-23 01:41:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 4472. [2020-12-23 01:41:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4472 states. [2020-12-23 01:41:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4472 states to 4472 states and 6309 transitions. [2020-12-23 01:41:56,839 INFO L78 Accepts]: Start accepts. Automaton has 4472 states and 6309 transitions. Word has length 177 [2020-12-23 01:41:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:56,839 INFO L481 AbstractCegarLoop]: Abstraction has 4472 states and 6309 transitions. [2020-12-23 01:41:56,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4472 states and 6309 transitions. [2020-12-23 01:41:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-23 01:41:56,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:56,847 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:57,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:41:57,062 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:57,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2144549849, now seen corresponding path program 1 times [2020-12-23 01:41:57,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:57,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870114158] [2020-12-23 01:41:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-12-23 01:41:57,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870114158] [2020-12-23 01:41:57,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570166802] [2020-12-23 01:41:57,184 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 [2020-12-23 01:41:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:57,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 01:41:57,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:41:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2020-12-23 01:41:57,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:41:57,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2020-12-23 01:41:57,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684122145] [2020-12-23 01:41:57,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:57,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:57,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:57,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:41:57,437 INFO L87 Difference]: Start difference. First operand 4472 states and 6309 transitions. Second operand 3 states. [2020-12-23 01:41:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:57,741 INFO L93 Difference]: Finished difference Result 7804 states and 10978 transitions. [2020-12-23 01:41:57,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:57,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-12-23 01:41:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:57,751 INFO L225 Difference]: With dead ends: 7804 [2020-12-23 01:41:57,751 INFO L226 Difference]: Without dead ends: 3299 [2020-12-23 01:41:57,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:41:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2020-12-23 01:41:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 3179. [2020-12-23 01:41:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3179 states. [2020-12-23 01:41:57,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4468 transitions. [2020-12-23 01:41:57,891 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4468 transitions. Word has length 177 [2020-12-23 01:41:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:57,892 INFO L481 AbstractCegarLoop]: Abstraction has 3179 states and 4468 transitions. [2020-12-23 01:41:57,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4468 transitions. [2020-12-23 01:41:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-23 01:41:57,898 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:57,898 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:58,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-12-23 01:41:58,112 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:58,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1199573560, now seen corresponding path program 2 times [2020-12-23 01:41:58,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:58,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981840329] [2020-12-23 01:41:58,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 191 proven. 19 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:41:58,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981840329] [2020-12-23 01:41:58,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703199485] [2020-12-23 01:41:58,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-12-23 01:41:58,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 01:41:58,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 01:41:58,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 01:41:58,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:41:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2020-12-23 01:41:58,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:41:58,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 01:41:58,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111521029] [2020-12-23 01:41:58,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:58,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:58,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:58,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:58,474 INFO L87 Difference]: Start difference. First operand 3179 states and 4468 transitions. Second operand 3 states. [2020-12-23 01:41:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:58,748 INFO L93 Difference]: Finished difference Result 6415 states and 9031 transitions. [2020-12-23 01:41:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:58,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-12-23 01:41:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:58,758 INFO L225 Difference]: With dead ends: 6415 [2020-12-23 01:41:58,758 INFO L226 Difference]: Without dead ends: 3363 [2020-12-23 01:41:58,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2020-12-23 01:41:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3179. [2020-12-23 01:41:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3179 states. [2020-12-23 01:41:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4452 transitions. [2020-12-23 01:41:58,893 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4452 transitions. Word has length 182 [2020-12-23 01:41:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:58,894 INFO L481 AbstractCegarLoop]: Abstraction has 3179 states and 4452 transitions. [2020-12-23 01:41:58,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4452 transitions. [2020-12-23 01:41:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-12-23 01:41:58,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:58,901 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:41:59,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:41:59,115 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:59,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:59,116 INFO L82 PathProgramCache]: Analyzing trace with hash -97142242, now seen corresponding path program 1 times [2020-12-23 01:41:59,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:59,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019816717] [2020-12-23 01:41:59,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:41:59,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019816717] [2020-12-23 01:41:59,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474929357] [2020-12-23 01:41:59,204 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 [2020-12-23 01:41:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:59,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 01:41:59,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:41:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2020-12-23 01:41:59,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:41:59,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 01:41:59,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723294557] [2020-12-23 01:41:59,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:59,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:59,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:59,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:59,563 INFO L87 Difference]: Start difference. First operand 3179 states and 4452 transitions. Second operand 3 states. [2020-12-23 01:41:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:59,884 INFO L93 Difference]: Finished difference Result 6311 states and 8831 transitions. [2020-12-23 01:41:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:59,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2020-12-23 01:41:59,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:59,900 INFO L225 Difference]: With dead ends: 6311 [2020-12-23 01:41:59,900 INFO L226 Difference]: Without dead ends: 3275 [2020-12-23 01:41:59,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:41:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2020-12-23 01:42:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3179. [2020-12-23 01:42:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3179 states. [2020-12-23 01:42:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4436 transitions. [2020-12-23 01:42:00,078 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4436 transitions. Word has length 184 [2020-12-23 01:42:00,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:00,079 INFO L481 AbstractCegarLoop]: Abstraction has 3179 states and 4436 transitions. [2020-12-23 01:42:00,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4436 transitions. [2020-12-23 01:42:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-12-23 01:42:00,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:00,084 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:00,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-12-23 01:42:00,300 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:00,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:00,301 INFO L82 PathProgramCache]: Analyzing trace with hash -301230506, now seen corresponding path program 3 times [2020-12-23 01:42:00,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:00,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305486087] [2020-12-23 01:42:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 196 proven. 27 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:42:00,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305486087] [2020-12-23 01:42:00,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818601890] [2020-12-23 01:42:00,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-12-23 01:42:00,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-12-23 01:42:00,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 01:42:00,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:00,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2020-12-23 01:42:00,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:42:00,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2020-12-23 01:42:00,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223136468] [2020-12-23 01:42:00,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:42:00,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:00,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:42:00,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 01:42:00,756 INFO L87 Difference]: Start difference. First operand 3179 states and 4436 transitions. Second operand 4 states. [2020-12-23 01:42:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:01,117 INFO L93 Difference]: Finished difference Result 6549 states and 9060 transitions. [2020-12-23 01:42:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:42:01,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2020-12-23 01:42:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:01,129 INFO L225 Difference]: With dead ends: 6549 [2020-12-23 01:42:01,129 INFO L226 Difference]: Without dead ends: 3561 [2020-12-23 01:42:01,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:42:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2020-12-23 01:42:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3171. [2020-12-23 01:42:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3171 states. [2020-12-23 01:42:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4420 transitions. [2020-12-23 01:42:01,319 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4420 transitions. Word has length 189 [2020-12-23 01:42:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:01,319 INFO L481 AbstractCegarLoop]: Abstraction has 3171 states and 4420 transitions. [2020-12-23 01:42:01,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:42:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4420 transitions. [2020-12-23 01:42:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-12-23 01:42:01,324 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:01,324 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:01,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-23 01:42:01,531 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:01,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2051917229, now seen corresponding path program 1 times [2020-12-23 01:42:01,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:01,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017198165] [2020-12-23 01:42:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:42:01,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:42:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:42:01,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:42:01,758 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:42:01,758 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:42:01,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 01:42:01,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:42:01 BoogieIcfgContainer [2020-12-23 01:42:01,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:42:01,965 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:42:01,965 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:42:01,965 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:42:01,966 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:42" (3/4) ... [2020-12-23 01:42:01,968 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 01:42:02,178 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_srvr_11.cil.c-witness.graphml [2020-12-23 01:42:02,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:42:02,181 INFO L168 Benchmark]: Toolchain (without parser) took 21789.38 ms. Allocated memory was 157.3 MB in the beginning and 880.8 MB in the end (delta: 723.5 MB). Free memory was 132.0 MB in the beginning and 747.1 MB in the end (delta: -615.1 MB). Peak memory consumption was 109.0 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:02,181 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 157.3 MB. Free memory is still 129.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:42:02,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.65 ms. Allocated memory is still 157.3 MB. Free memory was 131.8 MB in the beginning and 116.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:02,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.21 ms. Allocated memory is still 157.3 MB. Free memory was 116.2 MB in the beginning and 113.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:02,183 INFO L168 Benchmark]: Boogie Preprocessor took 45.47 ms. Allocated memory is still 157.3 MB. Free memory was 113.2 MB in the beginning and 111.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:02,183 INFO L168 Benchmark]: RCFGBuilder took 1033.29 ms. Allocated memory is still 157.3 MB. Free memory was 111.1 MB in the beginning and 88.2 MB in the end (delta: 22.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:02,184 INFO L168 Benchmark]: TraceAbstraction took 19808.82 ms. Allocated memory was 157.3 MB in the beginning and 880.8 MB in the end (delta: 723.5 MB). Free memory was 87.7 MB in the beginning and 769.6 MB in the end (delta: -682.0 MB). Peak memory consumption was 42.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:02,184 INFO L168 Benchmark]: Witness Printer took 213.45 ms. Allocated memory is still 880.8 MB. Free memory was 769.1 MB in the beginning and 747.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:02,186 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.21 ms. Allocated memory is still 157.3 MB. Free memory is still 129.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 598.65 ms. Allocated memory is still 157.3 MB. Free memory was 131.8 MB in the beginning and 116.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 79.21 ms. Allocated memory is still 157.3 MB. Free memory was 116.2 MB in the beginning and 113.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 45.47 ms. Allocated memory is still 157.3 MB. Free memory was 113.2 MB in the beginning and 111.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1033.29 ms. Allocated memory is still 157.3 MB. Free memory was 111.1 MB in the beginning and 88.2 MB in the end (delta: 22.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 19808.82 ms. Allocated memory was 157.3 MB in the beginning and 880.8 MB in the end (delta: 723.5 MB). Free memory was 87.7 MB in the beginning and 769.6 MB in the end (delta: -682.0 MB). Peak memory consumption was 42.1 MB. Max. memory is 8.0 GB. * Witness Printer took 213.45 ms. Allocated memory is still 880.8 MB. Free memory was 769.1 MB in the beginning and 747.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 632]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L637] int s ; [L638] int tmp ; [L642] s = 8464 [L14] int s__info_callback = __VERIFIER_nondet_int() ; [L15] int s__in_handshake = __VERIFIER_nondet_int() ; [L16] int s__state ; [L17] int s__new_session ; [L18] int s__server ; [L19] int s__version = __VERIFIER_nondet_int() ; [L20] int s__type ; [L21] int s__init_num ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__rwstate ; [L24] int s__init_buf___0 = 1; [L25] int s__debug = __VERIFIER_nondet_int() ; [L26] int s__shutdown ; [L27] int s__cert = __VERIFIER_nondet_int() ; [L28] int s__options = __VERIFIER_nondet_int() ; [L29] int s__verify_mode = __VERIFIER_nondet_int() ; [L30] int s__session__peer = __VERIFIER_nondet_int() ; [L31] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L32] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L35] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__cert_request ; [L37] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__use_rsa_tmp ; [L39] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__new_cipher__algorithms ; [L41] int s__s3__tmp__next_state___0 ; [L42] int s__s3__tmp__new_cipher__algo_strength ; [L43] int s__session__cipher ; [L44] int buf ; [L45] unsigned long l ; [L46] unsigned long Time ; [L47] unsigned long tmp ; [L48] int cb ; [L49] long num1 = __VERIFIER_nondet_long() ; [L50] int ret ; [L51] int new_state ; [L52] int state ; [L53] int skip ; [L54] int got_new_session ; [L55] int tmp___1 = __VERIFIER_nondet_int() ; [L56] int tmp___2 = __VERIFIER_nondet_int() ; [L57] int tmp___3 = __VERIFIER_nondet_int() ; [L58] int tmp___4 = __VERIFIER_nondet_int() ; [L59] int tmp___5 = __VERIFIER_nondet_int() ; [L60] int tmp___6 = __VERIFIER_nondet_int() ; [L61] int tmp___7 = __VERIFIER_nondet_int() ; [L62] long tmp___8 = __VERIFIER_nondet_long() ; [L63] int tmp___9 = __VERIFIER_nondet_int() ; [L64] int tmp___10 = __VERIFIER_nondet_int() ; [L65] int blastFlag ; [L66] int __cil_tmp55 ; [L67] unsigned long __cil_tmp56 ; [L68] unsigned long __cil_tmp57 ; [L69] unsigned long __cil_tmp58 = __VERIFIER_nondet_ulong() ; [L70] unsigned long __cil_tmp59 ; [L71] int __cil_tmp60 ; [L72] unsigned long __cil_tmp61 ; [L75] s__state = initial_state [L76] blastFlag = 0 [L77] tmp = __VERIFIER_nondet_int() [L78] Time = tmp [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] got_new_session = 0 [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback [L90] s__in_handshake ++ [L91] COND TRUE tmp___1 + 12288 [L92] COND TRUE tmp___2 + 16384 [L96] COND FALSE !(s__cert == 0) [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND TRUE s__state == 8464 [L273] s__shutdown = 0 [L274] ret = __VERIFIER_nondet_int() [L275] COND TRUE blastFlag == 0 [L276] blastFlag = 1 [L278] COND FALSE !(ret <= 0) [L281] got_new_session = 1 [L282] s__state = 8496 [L283] s__init_num = 0 [L586] COND FALSE !(! s__s3__tmp__reuse_message) [L604] COND FALSE !(state == 8576) [L621] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND TRUE s__state == 8496 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L295] COND FALSE !(ret <= 0) [L298] COND FALSE !(\read(s__hit)) [L301] s__state = 8512 [L303] s__init_num = 0 [L586] COND FALSE !(! s__s3__tmp__reuse_message) [L604] COND FALSE !(state == 8576) [L621] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND TRUE s__state == 8512 [L308] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L309] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L310] COND TRUE __cil_tmp56 + 256UL [L311] skip = 1 [L319] s__state = 8528 [L320] s__init_num = 0 [L586] COND FALSE !(! s__s3__tmp__reuse_message) [L604] COND FALSE !(state == 8576) [L621] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND TRUE s__state == 8528 [L324] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L325] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L327] __cil_tmp57 = (unsigned long )s__options [L328] COND TRUE __cil_tmp57 + 2097152UL [L329] s__s3__tmp__use_rsa_tmp = 1 [L334] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L361] ret = __VERIFIER_nondet_int() [L362] COND FALSE !(ret <= 0) [L379] s__state = 8544 [L380] s__init_num = 0 [L586] COND FALSE !(! s__s3__tmp__reuse_message) [L604] COND FALSE !(state == 8576) [L621] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND TRUE s__state == 8544 [L384] COND TRUE s__verify_mode + 1 [L385] COND FALSE !(s__session__peer != 0) [L396] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L397] __cil_tmp61 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L398] COND FALSE !(__cil_tmp61 + 256UL) [L408] s__s3__tmp__cert_request = 1 [L409] ret = __VERIFIER_nondet_int() [L410] COND FALSE !(ret <= 0) [L413] s__state = 8448 [L414] s__s3__tmp__next_state___0 = 8576 [L415] s__init_num = 0 [L586] COND FALSE !(! s__s3__tmp__reuse_message) [L604] COND FALSE !(state == 8576) [L621] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND FALSE !(s__state == 8544) [L157] COND FALSE !(s__state == 8545) [L160] COND FALSE !(s__state == 8560) [L163] COND FALSE !(s__state == 8561) [L166] COND TRUE s__state == 8448 [L436] COND FALSE !(num1 > 0L) [L445] s__state = s__s3__tmp__next_state___0 [L586] COND FALSE !(! s__s3__tmp__reuse_message) [L604] COND FALSE !(state == 8576) [L621] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND FALSE !(s__state == 8544) [L157] COND FALSE !(s__state == 8545) [L160] COND FALSE !(s__state == 8560) [L163] COND FALSE !(s__state == 8561) [L166] COND FALSE !(s__state == 8448) [L169] COND TRUE s__state == 8576 [L449] ret = __VERIFIER_nondet_int() [L450] COND FALSE !(ret <= 0) [L453] COND FALSE !(ret == 2) [L456] ret = __VERIFIER_nondet_int() [L457] COND FALSE !(ret <= 0) [L460] s__init_num = 0 [L461] s__state = 8592 [L586] COND FALSE !(! s__s3__tmp__reuse_message) [L604] COND TRUE state == 8576 [L605] COND TRUE s__state == 8592 [L606] COND TRUE tmp___1 != -12288 [L607] COND TRUE tmp___2 != -16384 [L608] COND TRUE __cil_tmp56 != 4294967040 [L609] COND TRUE __cil_tmp58 != 4294967294 [L610] COND TRUE tmp___7 != 1024 [L611] COND TRUE tmp___7 != 512 [L632] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.5s, OverallIterations: 38, TraceHistogramMax: 7, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6459 SDtfs, 5740 SDslu, 2456 SDs, 0 SdLazy, 3268 SolverSat, 1244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1549 GetRequests, 1488 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5835occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 1605 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 5451 NumberOfCodeBlocks, 5159 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 5214 ConstructedInterpolants, 0 QuantifiedInterpolants, 1228424 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2643 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 45 InterpolantComputations, 37 PerfectInterpolantSequences, 6988/7241 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...