/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:38:17,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:38:17,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:38:17,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:38:17,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:38:17,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:38:17,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:38:17,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:38:17,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:38:17,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:38:17,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:38:17,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:38:17,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:38:17,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:38:17,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:38:17,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:38:17,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:38:17,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:38:17,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:38:17,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:38:17,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:38:17,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:38:17,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:38:17,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:38:17,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:38:17,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:38:17,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:38:17,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:38:17,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:38:17,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:38:17,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:38:17,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:38:17,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:38:17,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:38:17,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:38:17,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:38:17,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:38:17,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:38:17,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:38:17,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:38:17,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:38:17,949 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:38:18,012 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:38:18,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:38:18,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:38:18,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:38:18,022 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:38:18,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:38:18,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:38:18,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:38:18,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:38:18,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:38:18,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:38:18,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:38:18,026 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:38:18,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:38:18,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:38:18,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:38:18,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:38:18,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:38:18,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:38:18,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:38:18,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:38:18,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:38:18,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:38:18,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:38:18,035 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:38:18,035 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:38:18,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:38:18,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:38:18,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:38:18,591 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:38:18,592 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:38:18,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2020-12-23 01:38:18,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d36419566/9059c2d4b8684c63b53d2a85ab11b0df/FLAGd02b845f5 [2020-12-23 01:38:19,411 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:38:19,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2020-12-23 01:38:19,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d36419566/9059c2d4b8684c63b53d2a85ab11b0df/FLAGd02b845f5 [2020-12-23 01:38:19,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d36419566/9059c2d4b8684c63b53d2a85ab11b0df [2020-12-23 01:38:19,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:38:19,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:38:19,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:38:19,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:38:19,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:38:19,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:38:19" (1/1) ... [2020-12-23 01:38:19,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b17dbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:38:19, skipping insertion in model container [2020-12-23 01:38:19,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:38:19" (1/1) ... [2020-12-23 01:38:19,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:38:19,871 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_connect_renegotiate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_connect~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ag_X~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__change_cipher_spec~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__change_cipher_spec~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__compress_meth~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__compress_meth~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__flags~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__flags~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__delay_buf_pop_ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_hit~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_connect_good~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres59~0,] [2020-12-23 01:38:20,166 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c[37184,37197] left hand side expression in assignment: lhs: VariableLHS[~__retres59~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2020-12-23 01:38:20,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:38:20,206 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_connect_renegotiate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_connect~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ag_X~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__change_cipher_spec~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__change_cipher_spec~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__compress_meth~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__compress_meth~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__flags~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__flags~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__delay_buf_pop_ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_hit~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_connect_good~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres59~0,] [2020-12-23 01:38:20,352 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c[37184,37197] left hand side expression in assignment: lhs: VariableLHS[~__retres59~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2020-12-23 01:38:20,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:38:20,387 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:38:20,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:38:20 WrapperNode [2020-12-23 01:38:20,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:38:20,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:38:20,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:38:20,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:38:20,402 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:38:20" (1/1) ... [2020-12-23 01:38:20,434 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:38:20" (1/1) ... [2020-12-23 01:38:20,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:38:20,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:38:20,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:38:20,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:38:20,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:38:20" (1/1) ... [2020-12-23 01:38:20,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:38:20" (1/1) ... [2020-12-23 01:38:20,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:38:20" (1/1) ... [2020-12-23 01:38:20,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:38:20" (1/1) ... [2020-12-23 01:38:20,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:38:20" (1/1) ... [2020-12-23 01:38:20,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:38:20" (1/1) ... [2020-12-23 01:38:20,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:38:20" (1/1) ... [2020-12-23 01:38:20,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:38:20,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:38:20,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:38:20,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:38:20,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:38:20" (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:38:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:38:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:38:20,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:38:20,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:38:20,857 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:38:21,549 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2020-12-23 01:38:21,550 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2020-12-23 01:38:21,560 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:38:21,560 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:38:21,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:38:21 BoogieIcfgContainer [2020-12-23 01:38:21,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:38:21,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:38:21,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:38:21,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:38:21,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:38:19" (1/3) ... [2020-12-23 01:38:21,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1eb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:38:21, skipping insertion in model container [2020-12-23 01:38:21,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:38:20" (2/3) ... [2020-12-23 01:38:21,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1eb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:38:21, skipping insertion in model container [2020-12-23 01:38:21,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:38:21" (3/3) ... [2020-12-23 01:38:21,575 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2020-12-23 01:38:21,583 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:38:21,589 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:38:21,611 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:38:21,642 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:38:21,642 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:38:21,642 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:38:21,642 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:38:21,643 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:38:21,643 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:38:21,643 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:38:21,643 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:38:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2020-12-23 01:38:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 01:38:21,672 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:21,673 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] [2020-12-23 01:38:21,674 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:21,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:21,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2020-12-23 01:38:21,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:21,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246690474] [2020-12-23 01:38:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:21,937 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:38:21,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246690474] [2020-12-23 01:38:21,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:21,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:21,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640413292] [2020-12-23 01:38:21,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:21,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:21,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:21,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:21,964 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2020-12-23 01:38:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:22,156 INFO L93 Difference]: Finished difference Result 246 states and 421 transitions. [2020-12-23 01:38:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:22,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-23 01:38:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:22,171 INFO L225 Difference]: With dead ends: 246 [2020-12-23 01:38:22,171 INFO L226 Difference]: Without dead ends: 112 [2020-12-23 01:38:22,175 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:38:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-23 01:38:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-12-23 01:38:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-23 01:38:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2020-12-23 01:38:22,226 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2020-12-23 01:38:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:22,227 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2020-12-23 01:38:22,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2020-12-23 01:38:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 01:38:22,229 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:22,229 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:38:22,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:38:22,230 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:22,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:22,231 INFO L82 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2020-12-23 01:38:22,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:22,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636224277] [2020-12-23 01:38:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:38:22,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636224277] [2020-12-23 01:38:22,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:22,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:22,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605164894] [2020-12-23 01:38:22,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:22,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:22,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:22,324 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand 3 states. [2020-12-23 01:38:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:22,487 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2020-12-23 01:38:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:22,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-23 01:38:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:22,490 INFO L225 Difference]: With dead ends: 233 [2020-12-23 01:38:22,490 INFO L226 Difference]: Without dead ends: 131 [2020-12-23 01:38:22,492 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:38:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-12-23 01:38:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2020-12-23 01:38:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-23 01:38:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2020-12-23 01:38:22,506 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2020-12-23 01:38:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:22,506 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2020-12-23 01:38:22,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2020-12-23 01:38:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 01:38:22,509 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:22,509 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:38:22,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:38:22,510 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:22,511 INFO L82 PathProgramCache]: Analyzing trace with hash 213639527, now seen corresponding path program 1 times [2020-12-23 01:38:22,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:22,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100644275] [2020-12-23 01:38:22,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 01:38:22,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100644275] [2020-12-23 01:38:22,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:22,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:22,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320561240] [2020-12-23 01:38:22,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:22,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:22,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:22,641 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand 3 states. [2020-12-23 01:38:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:22,820 INFO L93 Difference]: Finished difference Result 265 states and 400 transitions. [2020-12-23 01:38:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:22,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-23 01:38:22,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:22,823 INFO L225 Difference]: With dead ends: 265 [2020-12-23 01:38:22,823 INFO L226 Difference]: Without dead ends: 148 [2020-12-23 01:38:22,824 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:38:22,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-12-23 01:38:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2020-12-23 01:38:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-12-23 01:38:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2020-12-23 01:38:22,836 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2020-12-23 01:38:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:22,837 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2020-12-23 01:38:22,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2020-12-23 01:38:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 01:38:22,840 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:22,840 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:38:22,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:38:22,840 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:22,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:22,841 INFO L82 PathProgramCache]: Analyzing trace with hash 370823208, now seen corresponding path program 1 times [2020-12-23 01:38:22,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:22,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508710734] [2020-12-23 01:38:22,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 01:38:22,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508710734] [2020-12-23 01:38:22,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:22,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:22,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727758063] [2020-12-23 01:38:22,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:22,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:22,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:22,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:22,945 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand 3 states. [2020-12-23 01:38:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:23,104 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2020-12-23 01:38:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:23,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-12-23 01:38:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:23,107 INFO L225 Difference]: With dead ends: 328 [2020-12-23 01:38:23,107 INFO L226 Difference]: Without dead ends: 193 [2020-12-23 01:38:23,121 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:38:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-12-23 01:38:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2020-12-23 01:38:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-12-23 01:38:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2020-12-23 01:38:23,132 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 67 [2020-12-23 01:38:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:23,132 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2020-12-23 01:38:23,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2020-12-23 01:38:23,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 01:38:23,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:23,135 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:38:23,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:38:23,135 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:23,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:23,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1434615126, now seen corresponding path program 1 times [2020-12-23 01:38:23,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:23,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400197359] [2020-12-23 01:38:23,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 01:38:23,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400197359] [2020-12-23 01:38:23,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:23,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:23,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263820177] [2020-12-23 01:38:23,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:23,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:23,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:23,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:23,196 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand 3 states. [2020-12-23 01:38:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:23,326 INFO L93 Difference]: Finished difference Result 383 states and 548 transitions. [2020-12-23 01:38:23,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:23,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-12-23 01:38:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:23,329 INFO L225 Difference]: With dead ends: 383 [2020-12-23 01:38:23,330 INFO L226 Difference]: Without dead ends: 208 [2020-12-23 01:38:23,331 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:38:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-12-23 01:38:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2020-12-23 01:38:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-23 01:38:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2020-12-23 01:38:23,340 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 67 [2020-12-23 01:38:23,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:23,340 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2020-12-23 01:38:23,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2020-12-23 01:38:23,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 01:38:23,342 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:23,343 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:38:23,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:38:23,343 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1023824768, now seen corresponding path program 1 times [2020-12-23 01:38:23,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:23,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431439526] [2020-12-23 01:38:23,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-23 01:38:23,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431439526] [2020-12-23 01:38:23,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:23,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:23,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277206926] [2020-12-23 01:38:23,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:23,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:23,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:23,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:23,420 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand 3 states. [2020-12-23 01:38:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:23,547 INFO L93 Difference]: Finished difference Result 422 states and 598 transitions. [2020-12-23 01:38:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:23,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2020-12-23 01:38:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:23,551 INFO L225 Difference]: With dead ends: 422 [2020-12-23 01:38:23,551 INFO L226 Difference]: Without dead ends: 228 [2020-12-23 01:38:23,552 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:38:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-12-23 01:38:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2020-12-23 01:38:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-12-23 01:38:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2020-12-23 01:38:23,567 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 83 [2020-12-23 01:38:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:23,569 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2020-12-23 01:38:23,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2020-12-23 01:38:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 01:38:23,576 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:23,576 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:38:23,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:38:23,580 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:23,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:23,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1619803512, now seen corresponding path program 1 times [2020-12-23 01:38:23,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:23,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846556130] [2020-12-23 01:38:23,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 01:38:23,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846556130] [2020-12-23 01:38:23,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:23,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:23,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782308017] [2020-12-23 01:38:23,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:23,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:23,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:23,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:23,744 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand 3 states. [2020-12-23 01:38:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:23,777 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2020-12-23 01:38:23,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:23,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-12-23 01:38:23,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:23,780 INFO L225 Difference]: With dead ends: 652 [2020-12-23 01:38:23,781 INFO L226 Difference]: Without dead ends: 437 [2020-12-23 01:38:23,781 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:38:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-12-23 01:38:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-12-23 01:38:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-12-23 01:38:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 600 transitions. [2020-12-23 01:38:23,794 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 600 transitions. Word has length 103 [2020-12-23 01:38:23,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:23,795 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 600 transitions. [2020-12-23 01:38:23,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 600 transitions. [2020-12-23 01:38:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 01:38:23,796 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:23,797 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:38:23,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:38:23,797 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:23,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:23,798 INFO L82 PathProgramCache]: Analyzing trace with hash -713589126, now seen corresponding path program 1 times [2020-12-23 01:38:23,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:23,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619319094] [2020-12-23 01:38:23,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 01:38:23,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619319094] [2020-12-23 01:38:23,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:23,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:23,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583308361] [2020-12-23 01:38:23,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:23,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:23,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:23,851 INFO L87 Difference]: Start difference. First operand 437 states and 600 transitions. Second operand 3 states. [2020-12-23 01:38:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:23,883 INFO L93 Difference]: Finished difference Result 885 states and 1214 transitions. [2020-12-23 01:38:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:23,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-12-23 01:38:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:23,886 INFO L225 Difference]: With dead ends: 885 [2020-12-23 01:38:23,887 INFO L226 Difference]: Without dead ends: 458 [2020-12-23 01:38:23,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-12-23 01:38:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-12-23 01:38:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-12-23 01:38:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 627 transitions. [2020-12-23 01:38:23,901 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 627 transitions. Word has length 103 [2020-12-23 01:38:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:23,902 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 627 transitions. [2020-12-23 01:38:23,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 627 transitions. [2020-12-23 01:38:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 01:38:23,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:23,904 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:38:23,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:38:23,904 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:23,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:23,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1034569449, now seen corresponding path program 1 times [2020-12-23 01:38:23,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:23,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694054999] [2020-12-23 01:38:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-12-23 01:38:23,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694054999] [2020-12-23 01:38:23,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:23,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:23,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887403435] [2020-12-23 01:38:23,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:23,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:23,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:23,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:23,956 INFO L87 Difference]: Start difference. First operand 458 states and 627 transitions. Second operand 3 states. [2020-12-23 01:38:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:23,978 INFO L93 Difference]: Finished difference Result 932 states and 1274 transitions. [2020-12-23 01:38:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:23,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-23 01:38:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:23,982 INFO L225 Difference]: With dead ends: 932 [2020-12-23 01:38:23,982 INFO L226 Difference]: Without dead ends: 484 [2020-12-23 01:38:23,983 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:38:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-12-23 01:38:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2020-12-23 01:38:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2020-12-23 01:38:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 660 transitions. [2020-12-23 01:38:24,001 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 660 transitions. Word has length 104 [2020-12-23 01:38:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:24,002 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 660 transitions. [2020-12-23 01:38:24,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 660 transitions. [2020-12-23 01:38:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 01:38:24,004 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:24,004 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:38:24,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:38:24,004 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:24,005 INFO L82 PathProgramCache]: Analyzing trace with hash -53319870, now seen corresponding path program 1 times [2020-12-23 01:38:24,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:24,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424570299] [2020-12-23 01:38:24,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-12-23 01:38:24,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424570299] [2020-12-23 01:38:24,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:24,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:24,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523982202] [2020-12-23 01:38:24,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:24,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:24,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:24,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:24,063 INFO L87 Difference]: Start difference. First operand 484 states and 660 transitions. Second operand 3 states. [2020-12-23 01:38:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:24,117 INFO L93 Difference]: Finished difference Result 699 states and 957 transitions. [2020-12-23 01:38:24,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:24,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 01:38:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:24,121 INFO L225 Difference]: With dead ends: 699 [2020-12-23 01:38:24,122 INFO L226 Difference]: Without dead ends: 697 [2020-12-23 01:38:24,122 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:38:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2020-12-23 01:38:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2020-12-23 01:38:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-12-23 01:38:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 955 transitions. [2020-12-23 01:38:24,145 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 955 transitions. Word has length 105 [2020-12-23 01:38:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:24,146 INFO L481 AbstractCegarLoop]: Abstraction has 697 states and 955 transitions. [2020-12-23 01:38:24,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 955 transitions. [2020-12-23 01:38:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-23 01:38:24,152 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:24,152 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2020-12-23 01:38:24,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:38:24,153 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:24,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1519363111, now seen corresponding path program 1 times [2020-12-23 01:38:24,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:24,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026912692] [2020-12-23 01:38:24,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2020-12-23 01:38:24,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026912692] [2020-12-23 01:38:24,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:24,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:24,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383258325] [2020-12-23 01:38:24,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:24,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:24,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:24,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:24,284 INFO L87 Difference]: Start difference. First operand 697 states and 955 transitions. Second operand 3 states. [2020-12-23 01:38:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:24,485 INFO L93 Difference]: Finished difference Result 1508 states and 2127 transitions. [2020-12-23 01:38:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:24,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2020-12-23 01:38:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:24,491 INFO L225 Difference]: With dead ends: 1508 [2020-12-23 01:38:24,492 INFO L226 Difference]: Without dead ends: 844 [2020-12-23 01:38:24,493 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:38:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2020-12-23 01:38:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 814. [2020-12-23 01:38:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2020-12-23 01:38:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1144 transitions. [2020-12-23 01:38:24,528 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1144 transitions. Word has length 173 [2020-12-23 01:38:24,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:24,529 INFO L481 AbstractCegarLoop]: Abstraction has 814 states and 1144 transitions. [2020-12-23 01:38:24,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1144 transitions. [2020-12-23 01:38:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-23 01:38:24,535 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:24,535 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:38:24,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:38:24,536 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:24,536 INFO L82 PathProgramCache]: Analyzing trace with hash -598161639, now seen corresponding path program 2 times [2020-12-23 01:38:24,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:24,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203147186] [2020-12-23 01:38:24,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2020-12-23 01:38:24,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203147186] [2020-12-23 01:38:24,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:24,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:24,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125035857] [2020-12-23 01:38:24,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:24,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:24,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:24,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:24,725 INFO L87 Difference]: Start difference. First operand 814 states and 1144 transitions. Second operand 3 states. [2020-12-23 01:38:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:24,902 INFO L93 Difference]: Finished difference Result 1870 states and 2708 transitions. [2020-12-23 01:38:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:24,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-12-23 01:38:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:24,909 INFO L225 Difference]: With dead ends: 1870 [2020-12-23 01:38:24,909 INFO L226 Difference]: Without dead ends: 1041 [2020-12-23 01:38:24,911 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:38:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2020-12-23 01:38:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1003. [2020-12-23 01:38:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2020-12-23 01:38:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1396 transitions. [2020-12-23 01:38:24,939 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1396 transitions. Word has length 185 [2020-12-23 01:38:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:24,940 INFO L481 AbstractCegarLoop]: Abstraction has 1003 states and 1396 transitions. [2020-12-23 01:38:24,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1396 transitions. [2020-12-23 01:38:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-12-23 01:38:24,944 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:24,944 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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:38:24,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:38:24,944 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:24,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:24,945 INFO L82 PathProgramCache]: Analyzing trace with hash -759567935, now seen corresponding path program 1 times [2020-12-23 01:38:24,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:24,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820550313] [2020-12-23 01:38:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-12-23 01:38:25,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820550313] [2020-12-23 01:38:25,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:25,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:25,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584082946] [2020-12-23 01:38:25,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:25,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:25,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:25,223 INFO L87 Difference]: Start difference. First operand 1003 states and 1396 transitions. Second operand 3 states. [2020-12-23 01:38:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:25,276 INFO L93 Difference]: Finished difference Result 2282 states and 3180 transitions. [2020-12-23 01:38:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:25,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2020-12-23 01:38:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:25,287 INFO L225 Difference]: With dead ends: 2282 [2020-12-23 01:38:25,287 INFO L226 Difference]: Without dead ends: 1315 [2020-12-23 01:38:25,296 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:38:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2020-12-23 01:38:25,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2020-12-23 01:38:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2020-12-23 01:38:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1828 transitions. [2020-12-23 01:38:25,345 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1828 transitions. Word has length 194 [2020-12-23 01:38:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:25,346 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1828 transitions. [2020-12-23 01:38:25,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1828 transitions. [2020-12-23 01:38:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2020-12-23 01:38:25,351 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:25,351 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:38:25,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:38:25,351 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:25,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:25,352 INFO L82 PathProgramCache]: Analyzing trace with hash -915330113, now seen corresponding path program 1 times [2020-12-23 01:38:25,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:25,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568369923] [2020-12-23 01:38:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:38:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:38:25,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568369923] [2020-12-23 01:38:25,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:38:25,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:38:25,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37782267] [2020-12-23 01:38:25,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:38:25,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:38:25,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:38:25,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:38:25,505 INFO L87 Difference]: Start difference. First operand 1315 states and 1828 transitions. Second operand 3 states. [2020-12-23 01:38:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:38:25,567 INFO L93 Difference]: Finished difference Result 3583 states and 5032 transitions. [2020-12-23 01:38:25,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:38:25,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2020-12-23 01:38:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:38:25,580 INFO L225 Difference]: With dead ends: 3583 [2020-12-23 01:38:25,580 INFO L226 Difference]: Without dead ends: 2325 [2020-12-23 01:38:25,582 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:38:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2020-12-23 01:38:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2323. [2020-12-23 01:38:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2020-12-23 01:38:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3265 transitions. [2020-12-23 01:38:25,655 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3265 transitions. Word has length 196 [2020-12-23 01:38:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:38:25,656 INFO L481 AbstractCegarLoop]: Abstraction has 2323 states and 3265 transitions. [2020-12-23 01:38:25,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:38:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3265 transitions. [2020-12-23 01:38:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2020-12-23 01:38:25,661 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:38:25,661 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:38:25,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:38:25,662 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:38:25,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:38:25,662 INFO L82 PathProgramCache]: Analyzing trace with hash 342847369, now seen corresponding path program 1 times [2020-12-23 01:38:25,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:38:25,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679413189] [2020-12-23 01:38:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:38:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:38:25,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:38:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:38:25,782 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:38:25,898 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:38:25,898 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:38:25,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:38:26,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:38:26 BoogieIcfgContainer [2020-12-23 01:38:26,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:38:26,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:38:26,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:38:26,080 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:38:26,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:38:21" (3/4) ... [2020-12-23 01:38:26,084 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-23 01:38:26,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:38:26,088 INFO L168 Benchmark]: Toolchain (without parser) took 6324.42 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 126.5 MB in the beginning and 99.8 MB in the end (delta: 26.7 MB). Peak memory consumption was 94.0 MB. Max. memory is 8.0 GB. [2020-12-23 01:38:26,088 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory is still 122.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:38:26,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.99 ms. Allocated memory is still 151.0 MB. Free memory was 126.4 MB in the beginning and 111.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:38:26,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.53 ms. Allocated memory is still 151.0 MB. Free memory was 111.7 MB in the beginning and 109.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:38:26,101 INFO L168 Benchmark]: Boogie Preprocessor took 45.32 ms. Allocated memory is still 151.0 MB. Free memory was 109.0 MB in the beginning and 107.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:38:26,102 INFO L168 Benchmark]: RCFGBuilder took 1001.57 ms. Allocated memory is still 151.0 MB. Free memory was 106.9 MB in the beginning and 98.5 MB in the end (delta: 8.5 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:38:26,103 INFO L168 Benchmark]: TraceAbstraction took 4514.97 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 98.5 MB in the beginning and 99.8 MB in the end (delta: -1.3 MB). Peak memory consumption was 65.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:38:26,105 INFO L168 Benchmark]: Witness Printer took 4.87 ms. Allocated memory is still 218.1 MB. Free memory is still 99.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:38:26,109 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.20 ms. Allocated memory is still 151.0 MB. Free memory is still 122.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 621.99 ms. Allocated memory is still 151.0 MB. Free memory was 126.4 MB in the beginning and 111.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 122.53 ms. Allocated memory is still 151.0 MB. Free memory was 111.7 MB in the beginning and 109.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 45.32 ms. Allocated memory is still 151.0 MB. Free memory was 109.0 MB in the beginning and 107.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1001.57 ms. Allocated memory is still 151.0 MB. Free memory was 106.9 MB in the beginning and 98.5 MB in the end (delta: 8.5 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4514.97 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 98.5 MB in the beginning and 99.8 MB in the end (delta: -1.3 MB). Peak memory consumption was 65.2 MB. Max. memory is 8.0 GB. * Witness Printer took 4.87 ms. Allocated memory is still 218.1 MB. Free memory is still 99.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 609]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseXOr at line 357. Possible FailurePath: [L618] int __retres1 ; [L11] int s__info_callback = __VERIFIER_nondet_int(); [L12] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] unsigned int s__version = __VERIFIER_nondet_uint(); [L17] int s__type ; [L18] int s__init_num ; [L19] int s__bbio = __VERIFIER_nondet_int(); [L20] int s__wbio = __VERIFIER_nondet_int(); [L21] int s__hit = __VERIFIER_nondet_int(); [L22] int s__rwstate ; [L23] int s__init_buf___0 ; [L24] int s__debug = __VERIFIER_nondet_int(); [L25] int s__shutdown ; [L26] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L27] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L28] unsigned int s__ctx__stats__sess_connect ; [L29] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L30] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L31] int s__s3__change_cipher_spec ; [L32] int s__s3__flags ; [L33] int s__s3__delay_buf_pop_ret ; [L34] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L41] int s__session__cipher ; [L42] int s__session__compress_meth ; [L43] int buf ; [L44] unsigned long tmp ; [L45] unsigned long l ; [L46] int num1 ; [L47] int cb ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int tmp___0 ; [L53] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L54] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L55] int tmp___3 = __VERIFIER_nondet_int(); [L56] int tmp___4 = __VERIFIER_nondet_int(); [L57] int tmp___5 = __VERIFIER_nondet_int(); [L58] int tmp___6 = __VERIFIER_nondet_int(); [L59] int tmp___7 = __VERIFIER_nondet_int(); [L60] int tmp___8 = __VERIFIER_nondet_int(); [L61] int tmp___9 = __VERIFIER_nondet_int(); [L62] int blastFlag ; [L63] int ag_X ; [L64] int ag_Y = __VERIFIER_nondet_int(); [L65] int __retres59 ; [L68] s__state = 12292 [L69] blastFlag = 0 [L70] tmp = __VERIFIER_nondet_int() [L71] cb = 0 [L72] ret = -1 [L73] skip = 0 [L74] tmp___0 = 0 [L75] COND TRUE s__info_callback != 0 [L76] cb = s__info_callback [L84] s__in_handshake = s__in_handshake + 1 [L85] COND FALSE !(tmp___1 - 12288) [L95] COND TRUE 1 [L97] state = s__state [L98] COND TRUE s__state == 12292 [L201] s__new_session = 1 [L202] s__state = 4096 [L203] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L208] s__server = 0 [L209] COND TRUE cb != 0 [L214] COND FALSE !(s__version - 65280 != 768) [L220] s__type = 4096 [L221] COND FALSE !(s__init_buf___0 == 0) [L239] COND FALSE !(! tmp___4) [L245] COND FALSE !(! tmp___5) [L251] s__state = 4368 [L252] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L253] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND TRUE blastFlag == 0 [L260] blastFlag = 1 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND TRUE blastFlag == 1 [L285] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND TRUE blastFlag == 2 [L308] blastFlag = 3 [L312] COND FALSE !(ret <= 0) [L318] s__state = 4416 [L319] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L323] ret = __VERIFIER_nondet_int() [L324] COND TRUE blastFlag == 3 [L325] blastFlag = 4 [L329] COND FALSE !(ret <= 0) [L334] s__state = 4432 [L335] ag_X = (unsigned short)65535 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L346] ret = __VERIFIER_nondet_int() [L347] COND FALSE !(blastFlag == 5) [L352] COND FALSE !(ret <= 0) [L357] s__state = ag_X ^ ag_Y [L358] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND FALSE !(blastFlag == 0) [L262] COND TRUE blastFlag == 4 [L263] blastFlag = 5 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND FALSE !(blastFlag == 1) [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND FALSE !(blastFlag == 2) [L312] COND FALSE !(ret <= 0) [L318] s__state = 4416 [L319] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L323] ret = __VERIFIER_nondet_int() [L324] COND FALSE !(blastFlag == 3) [L329] COND FALSE !(ret <= 0) [L334] s__state = 4432 [L335] ag_X = (unsigned short)65535 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L346] ret = __VERIFIER_nondet_int() [L347] COND TRUE blastFlag == 5 [L609] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.2s, OverallIterations: 15, TraceHistogramMax: 11, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2634 SDtfs, 812 SDslu, 1502 SDs, 0 SdLazy, 896 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2323occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1686 NumberOfCodeBlocks, 1686 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1476 ConstructedInterpolants, 0 QuantifiedInterpolants, 447550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2791/2791 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...