/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/systemc/pipeline.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:24:10,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:24:10,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:24:10,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:24:10,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:24:10,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:24:10,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:24:10,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:24:10,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:24:10,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:24:10,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:24:10,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:24:10,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:24:10,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:24:10,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:24:10,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:24:10,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:24:10,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:24:10,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:24:10,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:24:10,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:24:10,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:24:10,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:24:10,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:24:10,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:24:10,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:24:10,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:24:10,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:24:10,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:24:10,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:24:10,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:24:10,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:24:10,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:24:10,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:24:10,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:24:10,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:24:10,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:24:10,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:24:10,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:24:10,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:24:10,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:24:10,959 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:24:11,004 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:24:11,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:24:11,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:24:11,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:24:11,010 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:24:11,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:24:11,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:24:11,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:24:11,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:24:11,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:24:11,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:24:11,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:24:11,013 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:24:11,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:24:11,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:24:11,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:24:11,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:24:11,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:24:11,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:24:11,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:24:11,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:24:11,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:24:11,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:24:11,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:24:11,032 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:24:11,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:24:11,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:24:11,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:24:11,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:24:11,424 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:24:11,424 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:24:11,425 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pipeline.cil-1.c [2021-01-06 19:24:11,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8abdcb348/9cf212c4dc0543668c6e88e78c155d02/FLAG9be300355 [2021-01-06 19:24:12,139 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:24:12,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/pipeline.cil-1.c [2021-01-06 19:24:12,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8abdcb348/9cf212c4dc0543668c6e88e78c155d02/FLAG9be300355 [2021-01-06 19:24:12,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8abdcb348/9cf212c4dc0543668c6e88e78c155d02 [2021-01-06 19:24:12,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:24:12,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:24:12,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:24:12,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:24:12,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:24:12,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:24:12" (1/1) ... [2021-01-06 19:24:12,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34185cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:12, skipping insertion in model container [2021-01-06 19:24:12,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:24:12" (1/1) ... [2021-01-06 19:24:12,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:24:12,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:24:12,715 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/systemc/pipeline.cil-1.c[335,348] left hand side expression in assignment: lhs: VariableLHS[~main_in1_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~1,] left hand side expression in assignment: lhs: VariableLHS[~b~1,] left hand side expression in assignment: lhs: VariableLHS[~main_sum_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~2,] left hand side expression in assignment: lhs: VariableLHS[~b~2,] left hand side expression in assignment: lhs: VariableLHS[~main_pres_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~3,] left hand side expression in assignment: lhs: VariableLHS[~b~3,] left hand side expression in assignment: lhs: VariableLHS[~main_zero_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~N_generate_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~D_print_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~main_in1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~N_generate_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~N_generate_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_print_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_print_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~N_generate_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_print_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~main_in1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~N_generate_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_print_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~count~0,] left hand side expression in assignment: lhs: VariableLHS[~N_generate_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_print_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~count~0,] left hand side expression in assignment: lhs: VariableLHS[~main_clk_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] [2021-01-06 19:24:12,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:24:12,838 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:24:12,859 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/systemc/pipeline.cil-1.c[335,348] left hand side expression in assignment: lhs: VariableLHS[~main_in1_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~1,] left hand side expression in assignment: lhs: VariableLHS[~b~1,] left hand side expression in assignment: lhs: VariableLHS[~main_sum_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~2,] left hand side expression in assignment: lhs: VariableLHS[~b~2,] left hand side expression in assignment: lhs: VariableLHS[~main_pres_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~3,] left hand side expression in assignment: lhs: VariableLHS[~b~3,] left hand side expression in assignment: lhs: VariableLHS[~main_zero_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~N_generate_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~D_print_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~main_in1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~N_generate_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~N_generate_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_print_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_print_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~N_generate_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_print_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~main_in1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~N_generate_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_print_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_in2_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_diff_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_sum_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_pres_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_dbl_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_zero_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_pos_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_neg_edge~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~count~0,] left hand side expression in assignment: lhs: VariableLHS[~N_generate_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S1_addsub_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S2_presdbl_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~S3_zero_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~D_print_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~count~0,] left hand side expression in assignment: lhs: VariableLHS[~main_clk_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main_clk_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] [2021-01-06 19:24:13,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:24:13,052 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:24:13,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13 WrapperNode [2021-01-06 19:24:13,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:24:13,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:24:13,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:24:13,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:24:13,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13" (1/1) ... [2021-01-06 19:24:13,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13" (1/1) ... [2021-01-06 19:24:13,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:24:13,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:24:13,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:24:13,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:24:13,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13" (1/1) ... [2021-01-06 19:24:13,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13" (1/1) ... [2021-01-06 19:24:13,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13" (1/1) ... [2021-01-06 19:24:13,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13" (1/1) ... [2021-01-06 19:24:13,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13" (1/1) ... [2021-01-06 19:24:13,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13" (1/1) ... [2021-01-06 19:24:13,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13" (1/1) ... [2021-01-06 19:24:13,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:24:13,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:24:13,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:24:13,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:24:13,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:24:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:24:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:24:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:24:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:24:14,639 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:24:14,640 INFO L299 CfgBuilder]: Removed 55 assume(true) statements. [2021-01-06 19:24:14,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:24:14 BoogieIcfgContainer [2021-01-06 19:24:14,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:24:14,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:24:14,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:24:14,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:24:14,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:24:12" (1/3) ... [2021-01-06 19:24:14,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9316e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:24:14, skipping insertion in model container [2021-01-06 19:24:14,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:13" (2/3) ... [2021-01-06 19:24:14,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9316e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:24:14, skipping insertion in model container [2021-01-06 19:24:14,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:24:14" (3/3) ... [2021-01-06 19:24:14,652 INFO L111 eAbstractionObserver]: Analyzing ICFG pipeline.cil-1.c [2021-01-06 19:24:14,658 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:24:14,664 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:24:14,683 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:24:14,714 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:24:14,714 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:24:14,715 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:24:14,715 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:24:14,715 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:24:14,715 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:24:14,715 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:24:14,715 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:24:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states. [2021-01-06 19:24:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 19:24:14,755 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:14,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:14,756 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:14,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1155336598, now seen corresponding path program 1 times [2021-01-06 19:24:14,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:14,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339995673] [2021-01-06 19:24:14,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:15,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339995673] [2021-01-06 19:24:15,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:15,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:15,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537080874] [2021-01-06 19:24:15,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:15,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:15,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:15,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:15,256 INFO L87 Difference]: Start difference. First operand 405 states. Second operand 4 states. [2021-01-06 19:24:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:15,462 INFO L93 Difference]: Finished difference Result 1135 states and 2109 transitions. [2021-01-06 19:24:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:15,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2021-01-06 19:24:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:15,512 INFO L225 Difference]: With dead ends: 1135 [2021-01-06 19:24:15,512 INFO L226 Difference]: Without dead ends: 733 [2021-01-06 19:24:15,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-01-06 19:24:15,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2021-01-06 19:24:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:24:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1324 transitions. [2021-01-06 19:24:15,656 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1324 transitions. Word has length 86 [2021-01-06 19:24:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:15,656 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1324 transitions. [2021-01-06 19:24:15,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1324 transitions. [2021-01-06 19:24:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:15,674 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:15,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:15,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:24:15,675 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:15,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:15,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1210635410, now seen corresponding path program 1 times [2021-01-06 19:24:15,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:15,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239576436] [2021-01-06 19:24:15,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:15,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239576436] [2021-01-06 19:24:15,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:15,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:15,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029389490] [2021-01-06 19:24:15,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:15,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:15,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:15,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:15,853 INFO L87 Difference]: Start difference. First operand 731 states and 1324 transitions. Second operand 4 states. [2021-01-06 19:24:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:15,973 INFO L93 Difference]: Finished difference Result 1437 states and 2606 transitions. [2021-01-06 19:24:15,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:15,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:15,979 INFO L225 Difference]: With dead ends: 1437 [2021-01-06 19:24:15,979 INFO L226 Difference]: Without dead ends: 733 [2021-01-06 19:24:15,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-01-06 19:24:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2021-01-06 19:24:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:24:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1319 transitions. [2021-01-06 19:24:16,007 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1319 transitions. Word has length 180 [2021-01-06 19:24:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:16,007 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1319 transitions. [2021-01-06 19:24:16,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1319 transitions. [2021-01-06 19:24:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:16,010 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:16,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:16,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:24:16,011 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:16,012 INFO L82 PathProgramCache]: Analyzing trace with hash 242857622, now seen corresponding path program 1 times [2021-01-06 19:24:16,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:16,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260785524] [2021-01-06 19:24:16,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:16,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260785524] [2021-01-06 19:24:16,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:16,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:16,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270377033] [2021-01-06 19:24:16,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:16,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:16,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:16,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:16,131 INFO L87 Difference]: Start difference. First operand 731 states and 1319 transitions. Second operand 4 states. [2021-01-06 19:24:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:16,220 INFO L93 Difference]: Finished difference Result 1435 states and 2593 transitions. [2021-01-06 19:24:16,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:16,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:16,225 INFO L225 Difference]: With dead ends: 1435 [2021-01-06 19:24:16,226 INFO L226 Difference]: Without dead ends: 733 [2021-01-06 19:24:16,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-01-06 19:24:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2021-01-06 19:24:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:24:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1314 transitions. [2021-01-06 19:24:16,250 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1314 transitions. Word has length 180 [2021-01-06 19:24:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:16,250 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1314 transitions. [2021-01-06 19:24:16,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1314 transitions. [2021-01-06 19:24:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:16,254 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:16,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:16,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:24:16,255 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:16,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:16,256 INFO L82 PathProgramCache]: Analyzing trace with hash -924628582, now seen corresponding path program 1 times [2021-01-06 19:24:16,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:16,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625429924] [2021-01-06 19:24:16,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:16,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625429924] [2021-01-06 19:24:16,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:16,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:16,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573668204] [2021-01-06 19:24:16,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:16,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:16,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:16,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:16,377 INFO L87 Difference]: Start difference. First operand 731 states and 1314 transitions. Second operand 4 states. [2021-01-06 19:24:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:16,455 INFO L93 Difference]: Finished difference Result 1434 states and 2582 transitions. [2021-01-06 19:24:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:16,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:16,460 INFO L225 Difference]: With dead ends: 1434 [2021-01-06 19:24:16,461 INFO L226 Difference]: Without dead ends: 733 [2021-01-06 19:24:16,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-01-06 19:24:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2021-01-06 19:24:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:24:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1309 transitions. [2021-01-06 19:24:16,485 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1309 transitions. Word has length 180 [2021-01-06 19:24:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:16,485 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1309 transitions. [2021-01-06 19:24:16,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1309 transitions. [2021-01-06 19:24:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:16,488 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:16,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:16,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:24:16,489 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash -415849768, now seen corresponding path program 1 times [2021-01-06 19:24:16,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:16,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262892396] [2021-01-06 19:24:16,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:16,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262892396] [2021-01-06 19:24:16,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:16,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:16,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103156334] [2021-01-06 19:24:16,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:16,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:16,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:16,573 INFO L87 Difference]: Start difference. First operand 731 states and 1309 transitions. Second operand 3 states. [2021-01-06 19:24:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:16,664 INFO L93 Difference]: Finished difference Result 1775 states and 3187 transitions. [2021-01-06 19:24:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:16,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2021-01-06 19:24:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:16,672 INFO L225 Difference]: With dead ends: 1775 [2021-01-06 19:24:16,672 INFO L226 Difference]: Without dead ends: 1075 [2021-01-06 19:24:16,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2021-01-06 19:24:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1073. [2021-01-06 19:24:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2021-01-06 19:24:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1903 transitions. [2021-01-06 19:24:16,714 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1903 transitions. Word has length 180 [2021-01-06 19:24:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:16,715 INFO L481 AbstractCegarLoop]: Abstraction has 1073 states and 1903 transitions. [2021-01-06 19:24:16,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1903 transitions. [2021-01-06 19:24:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:16,720 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:16,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:16,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:24:16,721 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:16,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash -526480548, now seen corresponding path program 1 times [2021-01-06 19:24:16,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:16,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995962598] [2021-01-06 19:24:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:16,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995962598] [2021-01-06 19:24:16,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:16,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:16,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132195992] [2021-01-06 19:24:16,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:16,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:16,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:16,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:16,869 INFO L87 Difference]: Start difference. First operand 1073 states and 1903 transitions. Second operand 4 states. [2021-01-06 19:24:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:17,118 INFO L93 Difference]: Finished difference Result 3209 states and 5627 transitions. [2021-01-06 19:24:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:17,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:17,134 INFO L225 Difference]: With dead ends: 3209 [2021-01-06 19:24:17,134 INFO L226 Difference]: Without dead ends: 2168 [2021-01-06 19:24:17,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2021-01-06 19:24:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 1469. [2021-01-06 19:24:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2021-01-06 19:24:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2519 transitions. [2021-01-06 19:24:17,192 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2519 transitions. Word has length 180 [2021-01-06 19:24:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:17,192 INFO L481 AbstractCegarLoop]: Abstraction has 1469 states and 2519 transitions. [2021-01-06 19:24:17,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2519 transitions. [2021-01-06 19:24:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:17,197 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:17,197 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:17,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:24:17,198 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:17,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:17,199 INFO L82 PathProgramCache]: Analyzing trace with hash 382202076, now seen corresponding path program 1 times [2021-01-06 19:24:17,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:17,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391932058] [2021-01-06 19:24:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:17,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391932058] [2021-01-06 19:24:17,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:17,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:17,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12532947] [2021-01-06 19:24:17,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:17,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:17,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:17,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:17,333 INFO L87 Difference]: Start difference. First operand 1469 states and 2519 transitions. Second operand 4 states. [2021-01-06 19:24:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:17,552 INFO L93 Difference]: Finished difference Result 4534 states and 7682 transitions. [2021-01-06 19:24:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:17,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:17,569 INFO L225 Difference]: With dead ends: 4534 [2021-01-06 19:24:17,569 INFO L226 Difference]: Without dead ends: 3125 [2021-01-06 19:24:17,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2021-01-06 19:24:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 2181. [2021-01-06 19:24:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2181 states. [2021-01-06 19:24:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3623 transitions. [2021-01-06 19:24:17,643 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3623 transitions. Word has length 180 [2021-01-06 19:24:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:17,643 INFO L481 AbstractCegarLoop]: Abstraction has 2181 states and 3623 transitions. [2021-01-06 19:24:17,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3623 transitions. [2021-01-06 19:24:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:17,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:17,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:17,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:24:17,649 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:17,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:17,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1796987740, now seen corresponding path program 1 times [2021-01-06 19:24:17,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:17,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677980007] [2021-01-06 19:24:17,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:17,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677980007] [2021-01-06 19:24:17,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:17,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:17,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428161105] [2021-01-06 19:24:17,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:17,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:17,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:17,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:17,719 INFO L87 Difference]: Start difference. First operand 2181 states and 3623 transitions. Second operand 4 states. [2021-01-06 19:24:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:17,994 INFO L93 Difference]: Finished difference Result 6885 states and 11308 transitions. [2021-01-06 19:24:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:17,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:17,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:18,020 INFO L225 Difference]: With dead ends: 6885 [2021-01-06 19:24:18,020 INFO L226 Difference]: Without dead ends: 4814 [2021-01-06 19:24:18,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states. [2021-01-06 19:24:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 3429. [2021-01-06 19:24:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3429 states. [2021-01-06 19:24:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 5543 transitions. [2021-01-06 19:24:18,141 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 5543 transitions. Word has length 180 [2021-01-06 19:24:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:18,141 INFO L481 AbstractCegarLoop]: Abstraction has 3429 states and 5543 transitions. [2021-01-06 19:24:18,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 5543 transitions. [2021-01-06 19:24:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:18,148 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:18,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:18,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:24:18,149 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1621057316, now seen corresponding path program 1 times [2021-01-06 19:24:18,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:18,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467647162] [2021-01-06 19:24:18,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:18,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467647162] [2021-01-06 19:24:18,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:18,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:18,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850711731] [2021-01-06 19:24:18,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:18,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:18,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:18,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:18,253 INFO L87 Difference]: Start difference. First operand 3429 states and 5543 transitions. Second operand 4 states. [2021-01-06 19:24:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:18,520 INFO L93 Difference]: Finished difference Result 10946 states and 17506 transitions. [2021-01-06 19:24:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:18,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:18,589 INFO L225 Difference]: With dead ends: 10946 [2021-01-06 19:24:18,590 INFO L226 Difference]: Without dead ends: 7715 [2021-01-06 19:24:18,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2021-01-06 19:24:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 5557. [2021-01-06 19:24:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5557 states. [2021-01-06 19:24:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5557 states to 5557 states and 8775 transitions. [2021-01-06 19:24:18,752 INFO L78 Accepts]: Start accepts. Automaton has 5557 states and 8775 transitions. Word has length 180 [2021-01-06 19:24:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:18,757 INFO L481 AbstractCegarLoop]: Abstraction has 5557 states and 8775 transitions. [2021-01-06 19:24:18,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5557 states and 8775 transitions. [2021-01-06 19:24:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:18,769 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:18,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:18,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:24:18,770 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:18,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:18,771 INFO L82 PathProgramCache]: Analyzing trace with hash 346893148, now seen corresponding path program 1 times [2021-01-06 19:24:18,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:18,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101315185] [2021-01-06 19:24:18,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:18,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101315185] [2021-01-06 19:24:18,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:18,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:18,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101378272] [2021-01-06 19:24:18,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:18,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:18,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:18,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:18,850 INFO L87 Difference]: Start difference. First operand 5557 states and 8775 transitions. Second operand 4 states. [2021-01-06 19:24:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:19,196 INFO L93 Difference]: Finished difference Result 16989 states and 26456 transitions. [2021-01-06 19:24:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:19,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:19,250 INFO L225 Difference]: With dead ends: 16989 [2021-01-06 19:24:19,251 INFO L226 Difference]: Without dead ends: 11783 [2021-01-06 19:24:19,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11783 states. [2021-01-06 19:24:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11783 to 8309. [2021-01-06 19:24:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8309 states. [2021-01-06 19:24:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8309 states to 8309 states and 12743 transitions. [2021-01-06 19:24:19,467 INFO L78 Accepts]: Start accepts. Automaton has 8309 states and 12743 transitions. Word has length 180 [2021-01-06 19:24:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:19,467 INFO L481 AbstractCegarLoop]: Abstraction has 8309 states and 12743 transitions. [2021-01-06 19:24:19,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 8309 states and 12743 transitions. [2021-01-06 19:24:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:19,481 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:19,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:19,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:24:19,481 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash -462548706, now seen corresponding path program 1 times [2021-01-06 19:24:19,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:19,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178622879] [2021-01-06 19:24:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:19,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178622879] [2021-01-06 19:24:19,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:19,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:19,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466206506] [2021-01-06 19:24:19,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:19,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:19,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:19,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:19,563 INFO L87 Difference]: Start difference. First operand 8309 states and 12743 transitions. Second operand 4 states. [2021-01-06 19:24:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:19,913 INFO L93 Difference]: Finished difference Result 24379 states and 36276 transitions. [2021-01-06 19:24:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:19,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:19,951 INFO L225 Difference]: With dead ends: 24379 [2021-01-06 19:24:19,951 INFO L226 Difference]: Without dead ends: 16630 [2021-01-06 19:24:19,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16630 states. [2021-01-06 19:24:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16630 to 11781. [2021-01-06 19:24:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11781 states. [2021-01-06 19:24:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11781 states to 11781 states and 17127 transitions. [2021-01-06 19:24:20,232 INFO L78 Accepts]: Start accepts. Automaton has 11781 states and 17127 transitions. Word has length 180 [2021-01-06 19:24:20,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:20,232 INFO L481 AbstractCegarLoop]: Abstraction has 11781 states and 17127 transitions. [2021-01-06 19:24:20,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 11781 states and 17127 transitions. [2021-01-06 19:24:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:20,250 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:20,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:20,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:24:20,251 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:20,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:20,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1194382688, now seen corresponding path program 1 times [2021-01-06 19:24:20,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:20,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101339988] [2021-01-06 19:24:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:20,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101339988] [2021-01-06 19:24:20,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:20,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:20,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706106388] [2021-01-06 19:24:20,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:20,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:20,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:20,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:20,327 INFO L87 Difference]: Start difference. First operand 11781 states and 17127 transitions. Second operand 4 states. [2021-01-06 19:24:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:20,843 INFO L93 Difference]: Finished difference Result 31369 states and 45350 transitions. [2021-01-06 19:24:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:20,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:20,888 INFO L225 Difference]: With dead ends: 31369 [2021-01-06 19:24:20,889 INFO L226 Difference]: Without dead ends: 20438 [2021-01-06 19:24:20,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20438 states. [2021-01-06 19:24:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20438 to 15269. [2021-01-06 19:24:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15269 states. [2021-01-06 19:24:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15269 states to 15269 states and 21543 transitions. [2021-01-06 19:24:21,375 INFO L78 Accepts]: Start accepts. Automaton has 15269 states and 21543 transitions. Word has length 180 [2021-01-06 19:24:21,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:21,376 INFO L481 AbstractCegarLoop]: Abstraction has 15269 states and 21543 transitions. [2021-01-06 19:24:21,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 15269 states and 21543 transitions. [2021-01-06 19:24:21,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:21,427 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:21,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:21,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:24:21,428 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1246496350, now seen corresponding path program 1 times [2021-01-06 19:24:21,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:21,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637647461] [2021-01-06 19:24:21,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:21,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637647461] [2021-01-06 19:24:21,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:21,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:21,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099007776] [2021-01-06 19:24:21,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:21,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:21,528 INFO L87 Difference]: Start difference. First operand 15269 states and 21543 transitions. Second operand 4 states. [2021-01-06 19:24:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:21,937 INFO L93 Difference]: Finished difference Result 34597 states and 49428 transitions. [2021-01-06 19:24:21,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:21,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:21,993 INFO L225 Difference]: With dead ends: 34597 [2021-01-06 19:24:21,993 INFO L226 Difference]: Without dead ends: 20469 [2021-01-06 19:24:22,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20469 states. [2021-01-06 19:24:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20469 to 15301. [2021-01-06 19:24:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15301 states. [2021-01-06 19:24:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15301 states to 15301 states and 21575 transitions. [2021-01-06 19:24:22,371 INFO L78 Accepts]: Start accepts. Automaton has 15301 states and 21575 transitions. Word has length 180 [2021-01-06 19:24:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:22,371 INFO L481 AbstractCegarLoop]: Abstraction has 15301 states and 21575 transitions. [2021-01-06 19:24:22,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 15301 states and 21575 transitions. [2021-01-06 19:24:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:22,405 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:22,405 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:22,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:24:22,405 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:22,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:22,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1738875102, now seen corresponding path program 1 times [2021-01-06 19:24:22,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:22,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558746132] [2021-01-06 19:24:22,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:22,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558746132] [2021-01-06 19:24:22,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:22,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:22,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881255997] [2021-01-06 19:24:22,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:22,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:22,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:22,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:22,582 INFO L87 Difference]: Start difference. First operand 15301 states and 21575 transitions. Second operand 3 states. [2021-01-06 19:24:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:22,968 INFO L93 Difference]: Finished difference Result 37206 states and 53495 transitions. [2021-01-06 19:24:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:22,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2021-01-06 19:24:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:23,017 INFO L225 Difference]: With dead ends: 37206 [2021-01-06 19:24:23,018 INFO L226 Difference]: Without dead ends: 23049 [2021-01-06 19:24:23,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23049 states. [2021-01-06 19:24:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23049 to 22567. [2021-01-06 19:24:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22567 states. [2021-01-06 19:24:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22567 states to 22567 states and 32397 transitions. [2021-01-06 19:24:23,493 INFO L78 Accepts]: Start accepts. Automaton has 22567 states and 32397 transitions. Word has length 180 [2021-01-06 19:24:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:23,495 INFO L481 AbstractCegarLoop]: Abstraction has 22567 states and 32397 transitions. [2021-01-06 19:24:23,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 22567 states and 32397 transitions. [2021-01-06 19:24:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:23,523 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:23,523 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:23,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:24:23,524 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:23,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:23,524 INFO L82 PathProgramCache]: Analyzing trace with hash -569224856, now seen corresponding path program 1 times [2021-01-06 19:24:23,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:23,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125232370] [2021-01-06 19:24:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:23,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125232370] [2021-01-06 19:24:23,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:23,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:23,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645641526] [2021-01-06 19:24:23,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:23,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:23,672 INFO L87 Difference]: Start difference. First operand 22567 states and 32397 transitions. Second operand 4 states. [2021-01-06 19:24:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:24,319 INFO L93 Difference]: Finished difference Result 50833 states and 73580 transitions. [2021-01-06 19:24:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:24,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:24,372 INFO L225 Difference]: With dead ends: 50833 [2021-01-06 19:24:24,372 INFO L226 Difference]: Without dead ends: 29424 [2021-01-06 19:24:24,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29424 states. [2021-01-06 19:24:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29424 to 24981. [2021-01-06 19:24:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24981 states. [2021-01-06 19:24:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24981 states to 24981 states and 36036 transitions. [2021-01-06 19:24:24,989 INFO L78 Accepts]: Start accepts. Automaton has 24981 states and 36036 transitions. Word has length 180 [2021-01-06 19:24:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:24,989 INFO L481 AbstractCegarLoop]: Abstraction has 24981 states and 36036 transitions. [2021-01-06 19:24:24,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 24981 states and 36036 transitions. [2021-01-06 19:24:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:25,018 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:25,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:25,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:24:25,019 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:25,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1154930602, now seen corresponding path program 1 times [2021-01-06 19:24:25,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:25,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869696323] [2021-01-06 19:24:25,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:25,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869696323] [2021-01-06 19:24:25,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:25,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:25,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240756167] [2021-01-06 19:24:25,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:25,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:25,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:25,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:25,085 INFO L87 Difference]: Start difference. First operand 24981 states and 36036 transitions. Second operand 4 states. [2021-01-06 19:24:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:25,733 INFO L93 Difference]: Finished difference Result 56415 states and 81970 transitions. [2021-01-06 19:24:25,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:25,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:25,795 INFO L225 Difference]: With dead ends: 56415 [2021-01-06 19:24:25,795 INFO L226 Difference]: Without dead ends: 32713 [2021-01-06 19:24:25,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32713 states. [2021-01-06 19:24:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32713 to 27825. [2021-01-06 19:24:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27825 states. [2021-01-06 19:24:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27825 states to 27825 states and 40354 transitions. [2021-01-06 19:24:26,452 INFO L78 Accepts]: Start accepts. Automaton has 27825 states and 40354 transitions. Word has length 180 [2021-01-06 19:24:26,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:26,452 INFO L481 AbstractCegarLoop]: Abstraction has 27825 states and 40354 transitions. [2021-01-06 19:24:26,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 27825 states and 40354 transitions. [2021-01-06 19:24:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:26,478 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:26,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:26,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:24:26,478 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:26,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:26,479 INFO L82 PathProgramCache]: Analyzing trace with hash -377799382, now seen corresponding path program 1 times [2021-01-06 19:24:26,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:26,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49135872] [2021-01-06 19:24:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:26,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49135872] [2021-01-06 19:24:26,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:26,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:26,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121149642] [2021-01-06 19:24:26,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:26,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:26,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:26,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:26,549 INFO L87 Difference]: Start difference. First operand 27825 states and 40354 transitions. Second operand 4 states. [2021-01-06 19:24:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:27,290 INFO L93 Difference]: Finished difference Result 63483 states and 92646 transitions. [2021-01-06 19:24:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:27,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:27,342 INFO L225 Difference]: With dead ends: 63483 [2021-01-06 19:24:27,342 INFO L226 Difference]: Without dead ends: 37083 [2021-01-06 19:24:27,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37083 states. [2021-01-06 19:24:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37083 to 31529. [2021-01-06 19:24:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31529 states. [2021-01-06 19:24:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31529 states to 31529 states and 46030 transitions. [2021-01-06 19:24:28,122 INFO L78 Accepts]: Start accepts. Automaton has 31529 states and 46030 transitions. Word has length 180 [2021-01-06 19:24:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:28,122 INFO L481 AbstractCegarLoop]: Abstraction has 31529 states and 46030 transitions. [2021-01-06 19:24:28,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 31529 states and 46030 transitions. [2021-01-06 19:24:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:28,149 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:28,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:28,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:24:28,149 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:28,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:28,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1812715606, now seen corresponding path program 1 times [2021-01-06 19:24:28,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:28,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204276067] [2021-01-06 19:24:28,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:28,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204276067] [2021-01-06 19:24:28,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:28,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:28,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705008145] [2021-01-06 19:24:28,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:28,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:28,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:28,223 INFO L87 Difference]: Start difference. First operand 31529 states and 46030 transitions. Second operand 4 states. [2021-01-06 19:24:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:29,052 INFO L93 Difference]: Finished difference Result 73523 states and 107894 transitions. [2021-01-06 19:24:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:29,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:29,133 INFO L225 Difference]: With dead ends: 73523 [2021-01-06 19:24:29,133 INFO L226 Difference]: Without dead ends: 43615 [2021-01-06 19:24:29,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43615 states. [2021-01-06 19:24:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43615 to 36953. [2021-01-06 19:24:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36953 states. [2021-01-06 19:24:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36953 states to 36953 states and 54422 transitions. [2021-01-06 19:24:29,935 INFO L78 Accepts]: Start accepts. Automaton has 36953 states and 54422 transitions. Word has length 180 [2021-01-06 19:24:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:29,935 INFO L481 AbstractCegarLoop]: Abstraction has 36953 states and 54422 transitions. [2021-01-06 19:24:29,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 36953 states and 54422 transitions. [2021-01-06 19:24:29,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:29,972 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:29,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:29,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:24:29,972 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:29,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:29,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1720455894, now seen corresponding path program 1 times [2021-01-06 19:24:29,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:29,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382124968] [2021-01-06 19:24:29,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:30,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382124968] [2021-01-06 19:24:30,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:30,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:30,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074701168] [2021-01-06 19:24:30,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:30,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:30,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:30,060 INFO L87 Difference]: Start difference. First operand 36953 states and 54422 transitions. Second operand 4 states. [2021-01-06 19:24:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:30,918 INFO L93 Difference]: Finished difference Result 93691 states and 137558 transitions. [2021-01-06 19:24:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:30,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:30,996 INFO L225 Difference]: With dead ends: 93691 [2021-01-06 19:24:30,996 INFO L226 Difference]: Without dead ends: 58655 [2021-01-06 19:24:31,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58655 states. [2021-01-06 19:24:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58655 to 45817. [2021-01-06 19:24:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45817 states. [2021-01-06 19:24:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45817 states to 45817 states and 67238 transitions. [2021-01-06 19:24:31,829 INFO L78 Accepts]: Start accepts. Automaton has 45817 states and 67238 transitions. Word has length 180 [2021-01-06 19:24:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:31,829 INFO L481 AbstractCegarLoop]: Abstraction has 45817 states and 67238 transitions. [2021-01-06 19:24:31,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 45817 states and 67238 transitions. [2021-01-06 19:24:31,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:31,872 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:31,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:31,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:24:31,873 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:31,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash 176523564, now seen corresponding path program 1 times [2021-01-06 19:24:31,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:31,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026519358] [2021-01-06 19:24:31,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:31,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026519358] [2021-01-06 19:24:31,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:31,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:31,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410168018] [2021-01-06 19:24:31,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:31,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:31,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:31,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:31,937 INFO L87 Difference]: Start difference. First operand 45817 states and 67238 transitions. Second operand 4 states. [2021-01-06 19:24:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:32,834 INFO L93 Difference]: Finished difference Result 114409 states and 166738 transitions. [2021-01-06 19:24:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:32,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:32,907 INFO L225 Difference]: With dead ends: 114409 [2021-01-06 19:24:32,907 INFO L226 Difference]: Without dead ends: 71007 [2021-01-06 19:24:32,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:32,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71007 states. [2021-01-06 19:24:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71007 to 56057. [2021-01-06 19:24:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56057 states. [2021-01-06 19:24:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56057 states to 56057 states and 82406 transitions. [2021-01-06 19:24:33,762 INFO L78 Accepts]: Start accepts. Automaton has 56057 states and 82406 transitions. Word has length 180 [2021-01-06 19:24:33,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:33,763 INFO L481 AbstractCegarLoop]: Abstraction has 56057 states and 82406 transitions. [2021-01-06 19:24:33,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 56057 states and 82406 transitions. [2021-01-06 19:24:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:33,827 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:33,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:33,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:24:33,827 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:33,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:33,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2046938386, now seen corresponding path program 1 times [2021-01-06 19:24:33,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:33,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504376850] [2021-01-06 19:24:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:34,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504376850] [2021-01-06 19:24:34,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:34,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:34,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282989118] [2021-01-06 19:24:34,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:34,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:34,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:34,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:34,257 INFO L87 Difference]: Start difference. First operand 56057 states and 82406 transitions. Second operand 4 states. [2021-01-06 19:24:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:34,939 INFO L93 Difference]: Finished difference Result 132709 states and 191483 transitions. [2021-01-06 19:24:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:34,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:35,017 INFO L225 Difference]: With dead ends: 132709 [2021-01-06 19:24:35,017 INFO L226 Difference]: Without dead ends: 79711 [2021-01-06 19:24:35,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79711 states. [2021-01-06 19:24:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79711 to 64281. [2021-01-06 19:24:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64281 states. [2021-01-06 19:24:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64281 states to 64281 states and 91974 transitions. [2021-01-06 19:24:36,223 INFO L78 Accepts]: Start accepts. Automaton has 64281 states and 91974 transitions. Word has length 180 [2021-01-06 19:24:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:36,223 INFO L481 AbstractCegarLoop]: Abstraction has 64281 states and 91974 transitions. [2021-01-06 19:24:36,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 64281 states and 91974 transitions. [2021-01-06 19:24:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:36,259 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:36,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:36,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:24:36,260 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:36,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:36,260 INFO L82 PathProgramCache]: Analyzing trace with hash 629545776, now seen corresponding path program 1 times [2021-01-06 19:24:36,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:36,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164228825] [2021-01-06 19:24:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:36,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164228825] [2021-01-06 19:24:36,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:36,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:36,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675661423] [2021-01-06 19:24:36,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:36,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:36,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:36,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:36,332 INFO L87 Difference]: Start difference. First operand 64281 states and 91974 transitions. Second operand 4 states. [2021-01-06 19:24:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:37,203 INFO L93 Difference]: Finished difference Result 180883 states and 259055 transitions. [2021-01-06 19:24:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:37,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:37,334 INFO L225 Difference]: With dead ends: 180883 [2021-01-06 19:24:37,334 INFO L226 Difference]: Without dead ends: 119091 [2021-01-06 19:24:37,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119091 states. [2021-01-06 19:24:38,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119091 to 88841. [2021-01-06 19:24:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88841 states. [2021-01-06 19:24:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88841 states to 88841 states and 125558 transitions. [2021-01-06 19:24:38,944 INFO L78 Accepts]: Start accepts. Automaton has 88841 states and 125558 transitions. Word has length 180 [2021-01-06 19:24:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:38,944 INFO L481 AbstractCegarLoop]: Abstraction has 88841 states and 125558 transitions. [2021-01-06 19:24:38,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 88841 states and 125558 transitions. [2021-01-06 19:24:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:39,001 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:39,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:39,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:24:39,001 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1246261392, now seen corresponding path program 1 times [2021-01-06 19:24:39,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:39,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882947305] [2021-01-06 19:24:39,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:39,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882947305] [2021-01-06 19:24:39,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:39,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:39,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391908530] [2021-01-06 19:24:39,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:39,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:39,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:39,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:39,079 INFO L87 Difference]: Start difference. First operand 88841 states and 125558 transitions. Second operand 4 states. [2021-01-06 19:24:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:40,201 INFO L93 Difference]: Finished difference Result 220655 states and 310282 transitions. [2021-01-06 19:24:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:40,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:24:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:40,339 INFO L225 Difference]: With dead ends: 220655 [2021-01-06 19:24:40,340 INFO L226 Difference]: Without dead ends: 136703 [2021-01-06 19:24:40,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136703 states. [2021-01-06 19:24:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136703 to 120937. [2021-01-06 19:24:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120937 states. [2021-01-06 19:24:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120937 states to 120937 states and 169782 transitions. [2021-01-06 19:24:42,688 INFO L78 Accepts]: Start accepts. Automaton has 120937 states and 169782 transitions. Word has length 180 [2021-01-06 19:24:42,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:42,688 INFO L481 AbstractCegarLoop]: Abstraction has 120937 states and 169782 transitions. [2021-01-06 19:24:42,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 120937 states and 169782 transitions. [2021-01-06 19:24:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:24:42,753 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:42,754 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:42,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:24:42,754 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:42,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:42,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1195432242, now seen corresponding path program 1 times [2021-01-06 19:24:42,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:42,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191668164] [2021-01-06 19:24:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:42,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191668164] [2021-01-06 19:24:42,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:42,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:42,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124875317] [2021-01-06 19:24:42,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:42,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:42,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:42,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:42,826 INFO L87 Difference]: Start difference. First operand 120937 states and 169782 transitions. Second operand 3 states. [2021-01-06 19:24:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:43,793 INFO L93 Difference]: Finished difference Result 213389 states and 299577 transitions. [2021-01-06 19:24:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:43,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2021-01-06 19:24:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:43,936 INFO L225 Difference]: With dead ends: 213389 [2021-01-06 19:24:43,936 INFO L226 Difference]: Without dead ends: 120937 [2021-01-06 19:24:43,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120937 states. [2021-01-06 19:24:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120937 to 120937. [2021-01-06 19:24:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120937 states. [2021-01-06 19:24:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120937 states to 120937 states and 169014 transitions. [2021-01-06 19:24:45,719 INFO L78 Accepts]: Start accepts. Automaton has 120937 states and 169014 transitions. Word has length 180 [2021-01-06 19:24:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:45,719 INFO L481 AbstractCegarLoop]: Abstraction has 120937 states and 169014 transitions. [2021-01-06 19:24:45,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 120937 states and 169014 transitions. [2021-01-06 19:24:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-01-06 19:24:45,791 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:45,791 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:45,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:24:45,791 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:45,792 INFO L82 PathProgramCache]: Analyzing trace with hash -750404731, now seen corresponding path program 1 times [2021-01-06 19:24:45,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:45,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110690709] [2021-01-06 19:24:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:46,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110690709] [2021-01-06 19:24:46,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:46,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:24:46,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795965395] [2021-01-06 19:24:46,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:24:46,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:46,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:24:46,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:46,312 INFO L87 Difference]: Start difference. First operand 120937 states and 169014 transitions. Second operand 5 states. [2021-01-06 19:24:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:47,049 INFO L93 Difference]: Finished difference Result 239625 states and 332707 transitions. [2021-01-06 19:24:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:24:47,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2021-01-06 19:24:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:47,722 INFO L225 Difference]: With dead ends: 239625 [2021-01-06 19:24:47,722 INFO L226 Difference]: Without dead ends: 147173 [2021-01-06 19:24:47,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:24:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147173 states. [2021-01-06 19:24:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147173 to 144589. [2021-01-06 19:24:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144589 states. [2021-01-06 19:24:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144589 states to 144589 states and 200123 transitions. [2021-01-06 19:24:49,619 INFO L78 Accepts]: Start accepts. Automaton has 144589 states and 200123 transitions. Word has length 182 [2021-01-06 19:24:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:49,619 INFO L481 AbstractCegarLoop]: Abstraction has 144589 states and 200123 transitions. [2021-01-06 19:24:49,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:24:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 144589 states and 200123 transitions. [2021-01-06 19:24:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-01-06 19:24:50,240 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:50,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:50,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:24:50,240 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:50,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:50,241 INFO L82 PathProgramCache]: Analyzing trace with hash 570050343, now seen corresponding path program 1 times [2021-01-06 19:24:50,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:50,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420736473] [2021-01-06 19:24:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:50,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420736473] [2021-01-06 19:24:50,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:50,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:50,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172702789] [2021-01-06 19:24:50,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:50,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:50,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:50,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:50,402 INFO L87 Difference]: Start difference. First operand 144589 states and 200123 transitions. Second operand 4 states. [2021-01-06 19:24:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:51,613 INFO L93 Difference]: Finished difference Result 287965 states and 398522 transitions. [2021-01-06 19:24:51,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:51,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2021-01-06 19:24:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:51,794 INFO L225 Difference]: With dead ends: 287965 [2021-01-06 19:24:51,794 INFO L226 Difference]: Without dead ends: 144591 [2021-01-06 19:24:51,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144591 states. [2021-01-06 19:24:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144591 to 144589. [2021-01-06 19:24:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144589 states. [2021-01-06 19:24:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144589 states to 144589 states and 198203 transitions. [2021-01-06 19:24:54,321 INFO L78 Accepts]: Start accepts. Automaton has 144589 states and 198203 transitions. Word has length 183 [2021-01-06 19:24:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:54,321 INFO L481 AbstractCegarLoop]: Abstraction has 144589 states and 198203 transitions. [2021-01-06 19:24:54,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 144589 states and 198203 transitions. [2021-01-06 19:24:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-01-06 19:24:54,408 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:54,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:54,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:24:54,408 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:54,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash -572452123, now seen corresponding path program 1 times [2021-01-06 19:24:54,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:54,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486077887] [2021-01-06 19:24:54,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:54,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486077887] [2021-01-06 19:24:54,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:54,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:54,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737874538] [2021-01-06 19:24:54,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:54,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:54,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:54,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:54,472 INFO L87 Difference]: Start difference. First operand 144589 states and 198203 transitions. Second operand 3 states. [2021-01-06 19:24:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:55,500 INFO L93 Difference]: Finished difference Result 270770 states and 372324 transitions. [2021-01-06 19:24:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:55,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2021-01-06 19:24:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:55,643 INFO L225 Difference]: With dead ends: 270770 [2021-01-06 19:24:55,643 INFO L226 Difference]: Without dead ends: 131233 [2021-01-06 19:24:55,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131233 states. [2021-01-06 19:24:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131233 to 131233. [2021-01-06 19:24:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131233 states. [2021-01-06 19:24:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131233 states to 131233 states and 178787 transitions. [2021-01-06 19:24:57,474 INFO L78 Accepts]: Start accepts. Automaton has 131233 states and 178787 transitions. Word has length 183 [2021-01-06 19:24:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:57,475 INFO L481 AbstractCegarLoop]: Abstraction has 131233 states and 178787 transitions. [2021-01-06 19:24:57,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 131233 states and 178787 transitions. [2021-01-06 19:24:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-01-06 19:24:58,318 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:58,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:58,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:24:58,318 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:58,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:58,319 INFO L82 PathProgramCache]: Analyzing trace with hash 427271973, now seen corresponding path program 1 times [2021-01-06 19:24:58,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:58,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164141804] [2021-01-06 19:24:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:58,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164141804] [2021-01-06 19:24:58,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:58,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:58,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459149357] [2021-01-06 19:24:58,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:58,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:58,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:58,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:58,485 INFO L87 Difference]: Start difference. First operand 131233 states and 178787 transitions. Second operand 3 states. [2021-01-06 19:24:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:59,887 INFO L93 Difference]: Finished difference Result 273267 states and 378682 transitions. [2021-01-06 19:24:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:59,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2021-01-06 19:24:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:00,102 INFO L225 Difference]: With dead ends: 273267 [2021-01-06 19:25:00,102 INFO L226 Difference]: Without dead ends: 147154 [2021-01-06 19:25:00,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147154 states. [2021-01-06 19:25:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147154 to 147154. [2021-01-06 19:25:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147154 states. [2021-01-06 19:25:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147154 states to 147154 states and 197317 transitions. [2021-01-06 19:25:02,619 INFO L78 Accepts]: Start accepts. Automaton has 147154 states and 197317 transitions. Word has length 183 [2021-01-06 19:25:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:02,620 INFO L481 AbstractCegarLoop]: Abstraction has 147154 states and 197317 transitions. [2021-01-06 19:25:02,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 147154 states and 197317 transitions. [2021-01-06 19:25:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-01-06 19:25:03,140 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:03,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:03,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:25:03,140 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1863226201, now seen corresponding path program 1 times [2021-01-06 19:25:03,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:03,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872282823] [2021-01-06 19:25:03,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:03,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872282823] [2021-01-06 19:25:03,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:03,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:03,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833460412] [2021-01-06 19:25:03,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:03,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:03,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:03,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:03,210 INFO L87 Difference]: Start difference. First operand 147154 states and 197317 transitions. Second operand 3 states. [2021-01-06 19:25:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:04,656 INFO L93 Difference]: Finished difference Result 300427 states and 401978 transitions. [2021-01-06 19:25:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:04,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2021-01-06 19:25:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:04,834 INFO L225 Difference]: With dead ends: 300427 [2021-01-06 19:25:04,834 INFO L226 Difference]: Without dead ends: 159419 [2021-01-06 19:25:04,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159419 states. [2021-01-06 19:25:07,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159419 to 154170. [2021-01-06 19:25:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154170 states. [2021-01-06 19:25:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154170 states to 154170 states and 206442 transitions. [2021-01-06 19:25:07,353 INFO L78 Accepts]: Start accepts. Automaton has 154170 states and 206442 transitions. Word has length 183 [2021-01-06 19:25:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:07,353 INFO L481 AbstractCegarLoop]: Abstraction has 154170 states and 206442 transitions. [2021-01-06 19:25:07,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 154170 states and 206442 transitions. [2021-01-06 19:25:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-01-06 19:25:07,444 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:07,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:07,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:25:07,445 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:07,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:07,445 INFO L82 PathProgramCache]: Analyzing trace with hash 722961195, now seen corresponding path program 1 times [2021-01-06 19:25:07,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:07,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911452381] [2021-01-06 19:25:07,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:07,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911452381] [2021-01-06 19:25:07,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:07,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:07,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400701859] [2021-01-06 19:25:07,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:07,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:07,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:07,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:07,539 INFO L87 Difference]: Start difference. First operand 154170 states and 206442 transitions. Second operand 3 states. [2021-01-06 19:25:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:08,735 INFO L93 Difference]: Finished difference Result 241962 states and 319835 transitions. [2021-01-06 19:25:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:08,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2021-01-06 19:25:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:08,832 INFO L225 Difference]: With dead ends: 241962 [2021-01-06 19:25:08,832 INFO L226 Difference]: Without dead ends: 92912 [2021-01-06 19:25:08,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92912 states. [2021-01-06 19:25:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92912 to 88880. [2021-01-06 19:25:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88880 states. [2021-01-06 19:25:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88880 states to 88880 states and 113711 transitions. [2021-01-06 19:25:10,432 INFO L78 Accepts]: Start accepts. Automaton has 88880 states and 113711 transitions. Word has length 183 [2021-01-06 19:25:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:10,433 INFO L481 AbstractCegarLoop]: Abstraction has 88880 states and 113711 transitions. [2021-01-06 19:25:10,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 88880 states and 113711 transitions. [2021-01-06 19:25:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-01-06 19:25:10,508 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:10,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:10,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:25:10,508 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:10,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:10,509 INFO L82 PathProgramCache]: Analyzing trace with hash -272961049, now seen corresponding path program 1 times [2021-01-06 19:25:10,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:10,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810589815] [2021-01-06 19:25:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:10,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810589815] [2021-01-06 19:25:10,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:10,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:25:10,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061878835] [2021-01-06 19:25:10,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:10,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:10,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:10,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:10,573 INFO L87 Difference]: Start difference. First operand 88880 states and 113711 transitions. Second operand 4 states. [2021-01-06 19:25:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:11,454 INFO L93 Difference]: Finished difference Result 144411 states and 186135 transitions. [2021-01-06 19:25:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:25:11,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2021-01-06 19:25:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:11,528 INFO L225 Difference]: With dead ends: 144411 [2021-01-06 19:25:11,528 INFO L226 Difference]: Without dead ends: 64641 [2021-01-06 19:25:11,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:11,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64641 states. [2021-01-06 19:25:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64641 to 64193. [2021-01-06 19:25:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64193 states. [2021-01-06 19:25:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64193 states to 64193 states and 82447 transitions. [2021-01-06 19:25:12,466 INFO L78 Accepts]: Start accepts. Automaton has 64193 states and 82447 transitions. Word has length 183 [2021-01-06 19:25:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:12,466 INFO L481 AbstractCegarLoop]: Abstraction has 64193 states and 82447 transitions. [2021-01-06 19:25:12,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 64193 states and 82447 transitions. [2021-01-06 19:25:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-01-06 19:25:12,497 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:12,497 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:12,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:25:12,498 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:12,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:12,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1964997816, now seen corresponding path program 1 times [2021-01-06 19:25:12,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:12,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240919471] [2021-01-06 19:25:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:12,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240919471] [2021-01-06 19:25:12,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:12,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:12,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361170618] [2021-01-06 19:25:12,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:12,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:12,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:12,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:12,599 INFO L87 Difference]: Start difference. First operand 64193 states and 82447 transitions. Second operand 3 states. [2021-01-06 19:25:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:13,433 INFO L93 Difference]: Finished difference Result 123178 states and 158734 transitions. [2021-01-06 19:25:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:13,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2021-01-06 19:25:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:13,498 INFO L225 Difference]: With dead ends: 123178 [2021-01-06 19:25:13,498 INFO L226 Difference]: Without dead ends: 64554 [2021-01-06 19:25:13,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64554 states. [2021-01-06 19:25:14,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64554 to 64554. [2021-01-06 19:25:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64554 states. [2021-01-06 19:25:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64554 states to 64554 states and 83026 transitions. [2021-01-06 19:25:14,417 INFO L78 Accepts]: Start accepts. Automaton has 64554 states and 83026 transitions. Word has length 191 [2021-01-06 19:25:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:14,417 INFO L481 AbstractCegarLoop]: Abstraction has 64554 states and 83026 transitions. [2021-01-06 19:25:14,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 64554 states and 83026 transitions. [2021-01-06 19:25:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-01-06 19:25:14,450 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:14,451 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:14,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:25:14,451 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:14,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1820144732, now seen corresponding path program 1 times [2021-01-06 19:25:14,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:14,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526400147] [2021-01-06 19:25:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:14,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526400147] [2021-01-06 19:25:14,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:14,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:14,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078026510] [2021-01-06 19:25:14,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:14,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:14,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:14,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:14,522 INFO L87 Difference]: Start difference. First operand 64554 states and 83026 transitions. Second operand 3 states. [2021-01-06 19:25:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:15,313 INFO L93 Difference]: Finished difference Result 124193 states and 160389 transitions. [2021-01-06 19:25:15,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:15,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2021-01-06 19:25:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:15,372 INFO L225 Difference]: With dead ends: 124193 [2021-01-06 19:25:15,373 INFO L226 Difference]: Without dead ends: 65208 [2021-01-06 19:25:15,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65208 states. [2021-01-06 19:25:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65208 to 65208. [2021-01-06 19:25:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65208 states. [2021-01-06 19:25:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65208 states to 65208 states and 84073 transitions. [2021-01-06 19:25:16,562 INFO L78 Accepts]: Start accepts. Automaton has 65208 states and 84073 transitions. Word has length 192 [2021-01-06 19:25:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:16,562 INFO L481 AbstractCegarLoop]: Abstraction has 65208 states and 84073 transitions. [2021-01-06 19:25:16,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 65208 states and 84073 transitions. [2021-01-06 19:25:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-01-06 19:25:16,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:16,597 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:16,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:25:16,597 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:16,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:16,598 INFO L82 PathProgramCache]: Analyzing trace with hash -400527807, now seen corresponding path program 1 times [2021-01-06 19:25:16,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:16,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576997071] [2021-01-06 19:25:16,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:16,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576997071] [2021-01-06 19:25:16,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:16,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:16,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801886443] [2021-01-06 19:25:16,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:16,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:16,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:16,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:16,684 INFO L87 Difference]: Start difference. First operand 65208 states and 84073 transitions. Second operand 3 states. [2021-01-06 19:25:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:17,482 INFO L93 Difference]: Finished difference Result 126082 states and 163414 transitions. [2021-01-06 19:25:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:17,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2021-01-06 19:25:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:17,548 INFO L225 Difference]: With dead ends: 126082 [2021-01-06 19:25:17,548 INFO L226 Difference]: Without dead ends: 66443 [2021-01-06 19:25:17,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66443 states. [2021-01-06 19:25:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66443 to 66443. [2021-01-06 19:25:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66443 states. [2021-01-06 19:25:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66443 states to 66443 states and 85993 transitions. [2021-01-06 19:25:18,837 INFO L78 Accepts]: Start accepts. Automaton has 66443 states and 85993 transitions. Word has length 193 [2021-01-06 19:25:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:18,838 INFO L481 AbstractCegarLoop]: Abstraction has 66443 states and 85993 transitions. [2021-01-06 19:25:18,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 66443 states and 85993 transitions. [2021-01-06 19:25:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-01-06 19:25:18,871 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:18,871 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:18,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:25:18,872 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:18,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1024669027, now seen corresponding path program 1 times [2021-01-06 19:25:18,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:18,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055680982] [2021-01-06 19:25:18,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:19,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055680982] [2021-01-06 19:25:19,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:19,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:19,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616385322] [2021-01-06 19:25:19,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:19,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:19,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:19,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:19,146 INFO L87 Difference]: Start difference. First operand 66443 states and 85993 transitions. Second operand 3 states. [2021-01-06 19:25:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:20,409 INFO L93 Difference]: Finished difference Result 129624 states and 168894 transitions. [2021-01-06 19:25:20,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:20,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2021-01-06 19:25:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:20,481 INFO L225 Difference]: With dead ends: 129624 [2021-01-06 19:25:20,481 INFO L226 Difference]: Without dead ends: 68750 [2021-01-06 19:25:20,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68750 states. [2021-01-06 19:25:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68750 to 68750. [2021-01-06 19:25:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68750 states. [2021-01-06 19:25:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68750 states to 68750 states and 89437 transitions. [2021-01-06 19:25:22,017 INFO L78 Accepts]: Start accepts. Automaton has 68750 states and 89437 transitions. Word has length 194 [2021-01-06 19:25:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:22,018 INFO L481 AbstractCegarLoop]: Abstraction has 68750 states and 89437 transitions. [2021-01-06 19:25:22,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 68750 states and 89437 transitions. [2021-01-06 19:25:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 19:25:22,055 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:22,055 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:22,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:25:22,056 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1296243398, now seen corresponding path program 1 times [2021-01-06 19:25:22,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:22,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281711762] [2021-01-06 19:25:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:22,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281711762] [2021-01-06 19:25:22,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:22,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:22,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627259080] [2021-01-06 19:25:22,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:22,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:22,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:22,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:22,285 INFO L87 Difference]: Start difference. First operand 68750 states and 89437 transitions. Second operand 3 states. [2021-01-06 19:25:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:24,013 INFO L93 Difference]: Finished difference Result 132898 states and 174646 transitions. [2021-01-06 19:25:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:24,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2021-01-06 19:25:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:24,084 INFO L225 Difference]: With dead ends: 132898 [2021-01-06 19:25:24,084 INFO L226 Difference]: Without dead ends: 73426 [2021-01-06 19:25:24,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73426 states. [2021-01-06 19:25:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73426 to 71186. [2021-01-06 19:25:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71186 states. [2021-01-06 19:25:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71186 states to 71186 states and 93399 transitions. [2021-01-06 19:25:26,026 INFO L78 Accepts]: Start accepts. Automaton has 71186 states and 93399 transitions. Word has length 195 [2021-01-06 19:25:26,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:26,027 INFO L481 AbstractCegarLoop]: Abstraction has 71186 states and 93399 transitions. [2021-01-06 19:25:26,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 71186 states and 93399 transitions. [2021-01-06 19:25:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-01-06 19:25:26,063 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:26,063 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:26,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 19:25:26,063 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:26,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:26,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1260230003, now seen corresponding path program 1 times [2021-01-06 19:25:26,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:26,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655936468] [2021-01-06 19:25:26,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:26,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655936468] [2021-01-06 19:25:26,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:26,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:26,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014206799] [2021-01-06 19:25:26,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:26,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:26,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:26,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:26,129 INFO L87 Difference]: Start difference. First operand 71186 states and 93399 transitions. Second operand 3 states. [2021-01-06 19:25:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:28,056 INFO L93 Difference]: Finished difference Result 135376 states and 178664 transitions. [2021-01-06 19:25:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:28,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2021-01-06 19:25:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:28,129 INFO L225 Difference]: With dead ends: 135376 [2021-01-06 19:25:28,129 INFO L226 Difference]: Without dead ends: 73468 [2021-01-06 19:25:28,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73468 states. [2021-01-06 19:25:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73468 to 71228. [2021-01-06 19:25:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71228 states. [2021-01-06 19:25:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71228 states to 71228 states and 93455 transitions. [2021-01-06 19:25:30,281 INFO L78 Accepts]: Start accepts. Automaton has 71228 states and 93455 transitions. Word has length 197 [2021-01-06 19:25:30,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:30,282 INFO L481 AbstractCegarLoop]: Abstraction has 71228 states and 93455 transitions. [2021-01-06 19:25:30,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 71228 states and 93455 transitions. [2021-01-06 19:25:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:25:30,333 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:30,334 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:30,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 19:25:30,334 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1059934906, now seen corresponding path program 1 times [2021-01-06 19:25:30,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:30,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710426154] [2021-01-06 19:25:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:30,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710426154] [2021-01-06 19:25:30,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:30,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:30,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749799209] [2021-01-06 19:25:30,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:30,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:30,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:30,533 INFO L87 Difference]: Start difference. First operand 71228 states and 93455 transitions. Second operand 3 states. [2021-01-06 19:25:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:33,478 INFO L93 Difference]: Finished difference Result 144330 states and 191952 transitions. [2021-01-06 19:25:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:33,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2021-01-06 19:25:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:33,563 INFO L225 Difference]: With dead ends: 144330 [2021-01-06 19:25:33,563 INFO L226 Difference]: Without dead ends: 78673 [2021-01-06 19:25:33,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78673 states. [2021-01-06 19:25:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78673 to 75061. [2021-01-06 19:25:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75061 states. [2021-01-06 19:25:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75061 states to 75061 states and 99688 transitions. [2021-01-06 19:25:36,198 INFO L78 Accepts]: Start accepts. Automaton has 75061 states and 99688 transitions. Word has length 199 [2021-01-06 19:25:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:36,199 INFO L481 AbstractCegarLoop]: Abstraction has 75061 states and 99688 transitions. [2021-01-06 19:25:36,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 75061 states and 99688 transitions. [2021-01-06 19:25:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-01-06 19:25:36,250 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:36,250 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:36,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 19:25:36,251 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:36,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:36,251 INFO L82 PathProgramCache]: Analyzing trace with hash -365408011, now seen corresponding path program 1 times [2021-01-06 19:25:36,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:36,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596457547] [2021-01-06 19:25:36,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:36,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596457547] [2021-01-06 19:25:36,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:36,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:36,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106785899] [2021-01-06 19:25:36,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:36,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:36,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:36,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:36,323 INFO L87 Difference]: Start difference. First operand 75061 states and 99688 transitions. Second operand 3 states. [2021-01-06 19:25:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:38,908 INFO L93 Difference]: Finished difference Result 148313 states and 198395 transitions. [2021-01-06 19:25:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:38,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2021-01-06 19:25:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:38,985 INFO L225 Difference]: With dead ends: 148313 [2021-01-06 19:25:38,986 INFO L226 Difference]: Without dead ends: 78823 [2021-01-06 19:25:39,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78823 states. [2021-01-06 19:25:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78823 to 75211. [2021-01-06 19:25:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75211 states. [2021-01-06 19:25:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75211 states to 75211 states and 99868 transitions. [2021-01-06 19:25:41,571 INFO L78 Accepts]: Start accepts. Automaton has 75211 states and 99868 transitions. Word has length 201 [2021-01-06 19:25:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:41,572 INFO L481 AbstractCegarLoop]: Abstraction has 75211 states and 99868 transitions. [2021-01-06 19:25:41,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 75211 states and 99868 transitions. [2021-01-06 19:25:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-01-06 19:25:41,611 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:41,611 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:41,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 19:25:41,611 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:41,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:41,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1010678470, now seen corresponding path program 1 times [2021-01-06 19:25:41,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:41,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703992035] [2021-01-06 19:25:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:41,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703992035] [2021-01-06 19:25:41,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:41,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:41,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425892000] [2021-01-06 19:25:41,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:41,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:41,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:41,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:41,684 INFO L87 Difference]: Start difference. First operand 75211 states and 99868 transitions. Second operand 3 states. [2021-01-06 19:25:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:45,492 INFO L93 Difference]: Finished difference Result 156729 states and 211911 transitions. [2021-01-06 19:25:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:45,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2021-01-06 19:25:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:45,585 INFO L225 Difference]: With dead ends: 156729 [2021-01-06 19:25:45,586 INFO L226 Difference]: Without dead ends: 87089 [2021-01-06 19:25:45,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87089 states. [2021-01-06 19:25:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87089 to 81525. [2021-01-06 19:25:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81525 states. [2021-01-06 19:25:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81525 states to 81525 states and 109984 transitions. [2021-01-06 19:25:49,070 INFO L78 Accepts]: Start accepts. Automaton has 81525 states and 109984 transitions. Word has length 203 [2021-01-06 19:25:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:49,071 INFO L481 AbstractCegarLoop]: Abstraction has 81525 states and 109984 transitions. [2021-01-06 19:25:49,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 81525 states and 109984 transitions. [2021-01-06 19:25:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-01-06 19:25:49,118 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:49,118 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:49,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 19:25:49,118 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1899979317, now seen corresponding path program 1 times [2021-01-06 19:25:49,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:49,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865574240] [2021-01-06 19:25:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:49,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865574240] [2021-01-06 19:25:49,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245818288] [2021-01-06 19:25:49,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:25:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:49,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:25:49,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:25:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:25:49,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:25:49,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 19:25:49,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506356097] [2021-01-06 19:25:49,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:49,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:49,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:49,889 INFO L87 Difference]: Start difference. First operand 81525 states and 109984 transitions. Second operand 3 states. [2021-01-06 19:25:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:53,842 INFO L93 Difference]: Finished difference Result 189466 states and 258049 transitions. [2021-01-06 19:25:53,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:53,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2021-01-06 19:25:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:53,959 INFO L225 Difference]: With dead ends: 189466 [2021-01-06 19:25:53,959 INFO L226 Difference]: Without dead ends: 117506 [2021-01-06 19:25:53,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117506 states. [2021-01-06 19:25:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117506 to 117504. [2021-01-06 19:25:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117504 states. [2021-01-06 19:25:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117504 states to 117504 states and 158869 transitions. [2021-01-06 19:25:58,623 INFO L78 Accepts]: Start accepts. Automaton has 117504 states and 158869 transitions. Word has length 205 [2021-01-06 19:25:58,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:58,623 INFO L481 AbstractCegarLoop]: Abstraction has 117504 states and 158869 transitions. [2021-01-06 19:25:58,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 117504 states and 158869 transitions. [2021-01-06 19:25:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-01-06 19:25:58,688 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:58,688 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:58,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-01-06 19:25:58,902 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash 211035575, now seen corresponding path program 1 times [2021-01-06 19:25:58,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:58,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865318495] [2021-01-06 19:25:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:59,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865318495] [2021-01-06 19:25:59,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111149379] [2021-01-06 19:25:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:25:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:59,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 19:25:59,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:25:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:59,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:25:59,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 19:25:59,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437119835] [2021-01-06 19:25:59,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:59,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:59,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:59,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:59,758 INFO L87 Difference]: Start difference. First operand 117504 states and 158869 transitions. Second operand 3 states. [2021-01-06 19:26:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:05,232 INFO L93 Difference]: Finished difference Result 238597 states and 325341 transitions. [2021-01-06 19:26:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:05,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2021-01-06 19:26:05,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:05,380 INFO L225 Difference]: With dead ends: 238597 [2021-01-06 19:26:05,380 INFO L226 Difference]: Without dead ends: 126664 [2021-01-06 19:26:05,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126664 states. [2021-01-06 19:26:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126664 to 118384. [2021-01-06 19:26:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118384 states. [2021-01-06 19:26:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118384 states to 118384 states and 159925 transitions. [2021-01-06 19:26:10,473 INFO L78 Accepts]: Start accepts. Automaton has 118384 states and 159925 transitions. Word has length 205 [2021-01-06 19:26:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:10,473 INFO L481 AbstractCegarLoop]: Abstraction has 118384 states and 159925 transitions. [2021-01-06 19:26:10,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 118384 states and 159925 transitions. [2021-01-06 19:26:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-01-06 19:26:10,542 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:10,542 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:10,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:26:10,743 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:10,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:10,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1849216196, now seen corresponding path program 1 times [2021-01-06 19:26:10,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:10,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390148587] [2021-01-06 19:26:10,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:26:10,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390148587] [2021-01-06 19:26:10,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9849626] [2021-01-06 19:26:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:26:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:10,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 19:26:11,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:26:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:26:11,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:26:11,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 19:26:11,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842405333] [2021-01-06 19:26:11,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:11,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:11,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:11,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:11,516 INFO L87 Difference]: Start difference. First operand 118384 states and 159925 transitions. Second operand 3 states. [2021-01-06 19:26:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:18,984 INFO L93 Difference]: Finished difference Result 261757 states and 361561 transitions. [2021-01-06 19:26:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:18,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2021-01-06 19:26:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:19,313 INFO L225 Difference]: With dead ends: 261757 [2021-01-06 19:26:19,313 INFO L226 Difference]: Without dead ends: 148944 [2021-01-06 19:26:19,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148944 states. [2021-01-06 19:26:26,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148944 to 136372. [2021-01-06 19:26:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136372 states. [2021-01-06 19:26:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136372 states to 136372 states and 187751 transitions. [2021-01-06 19:26:26,418 INFO L78 Accepts]: Start accepts. Automaton has 136372 states and 187751 transitions. Word has length 207 [2021-01-06 19:26:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:26,418 INFO L481 AbstractCegarLoop]: Abstraction has 136372 states and 187751 transitions. [2021-01-06 19:26:26,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 136372 states and 187751 transitions. [2021-01-06 19:26:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-01-06 19:26:26,499 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:26,499 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:26,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:26:26,700 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:26,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash -211214601, now seen corresponding path program 1 times [2021-01-06 19:26:26,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:26,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78721012] [2021-01-06 19:26:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:26:26,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78721012] [2021-01-06 19:26:26,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159140182] [2021-01-06 19:26:26,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:26:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:26,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 19:26:27,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:26:27,503 WARN L197 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2021-01-06 19:26:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:26:27,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:26:27,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 19:26:27,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16177838] [2021-01-06 19:26:27,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:27,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:27,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:27,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:27,604 INFO L87 Difference]: Start difference. First operand 136372 states and 187751 transitions. Second operand 3 states. [2021-01-06 19:26:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:32,311 INFO L93 Difference]: Finished difference Result 231637 states and 319641 transitions. [2021-01-06 19:26:32,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:32,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2021-01-06 19:26:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:32,436 INFO L225 Difference]: With dead ends: 231637 [2021-01-06 19:26:32,436 INFO L226 Difference]: Without dead ends: 105323 [2021-01-06 19:26:32,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105323 states. [2021-01-06 19:26:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105323 to 105323. [2021-01-06 19:26:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105323 states. [2021-01-06 19:26:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105323 states to 105323 states and 143608 transitions. [2021-01-06 19:26:37,646 INFO L78 Accepts]: Start accepts. Automaton has 105323 states and 143608 transitions. Word has length 209 [2021-01-06 19:26:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:37,646 INFO L481 AbstractCegarLoop]: Abstraction has 105323 states and 143608 transitions. [2021-01-06 19:26:37,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 105323 states and 143608 transitions. [2021-01-06 19:26:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-01-06 19:26:37,708 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:37,708 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:37,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:26:37,910 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:37,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash -573254857, now seen corresponding path program 1 times [2021-01-06 19:26:37,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:37,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385733997] [2021-01-06 19:26:37,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:26:38,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385733997] [2021-01-06 19:26:38,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734884039] [2021-01-06 19:26:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:26:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:38,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 19:26:38,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:26:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:26:38,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:26:38,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2021-01-06 19:26:38,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114008726] [2021-01-06 19:26:38,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:38,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:38,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:38,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:26:38,410 INFO L87 Difference]: Start difference. First operand 105323 states and 143608 transitions. Second operand 4 states. [2021-01-06 19:26:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:47,969 INFO L93 Difference]: Finished difference Result 294744 states and 399616 transitions. [2021-01-06 19:26:47,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:47,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2021-01-06 19:26:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:48,558 INFO L225 Difference]: With dead ends: 294744 [2021-01-06 19:26:48,559 INFO L226 Difference]: Without dead ends: 231599 [2021-01-06 19:26:48,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:26:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231599 states. [2021-01-06 19:26:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231599 to 168462. [2021-01-06 19:26:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168462 states. [2021-01-06 19:26:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168462 states to 168462 states and 228941 transitions. [2021-01-06 19:26:58,681 INFO L78 Accepts]: Start accepts. Automaton has 168462 states and 228941 transitions. Word has length 209 [2021-01-06 19:26:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:58,681 INFO L481 AbstractCegarLoop]: Abstraction has 168462 states and 228941 transitions. [2021-01-06 19:26:58,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 168462 states and 228941 transitions. [2021-01-06 19:26:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2021-01-06 19:26:58,816 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:58,817 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:59,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-01-06 19:26:59,018 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:59,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash 963844899, now seen corresponding path program 1 times [2021-01-06 19:26:59,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:59,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764996882] [2021-01-06 19:26:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-01-06 19:26:59,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764996882] [2021-01-06 19:26:59,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336457579] [2021-01-06 19:26:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:26:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:59,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 19:26:59,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:27:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:27:00,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:27:00,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2021-01-06 19:27:00,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045027725] [2021-01-06 19:27:00,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:00,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:00,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:00,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:27:00,056 INFO L87 Difference]: Start difference. First operand 168462 states and 228941 transitions. Second operand 4 states. [2021-01-06 19:27:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:07,041 INFO L93 Difference]: Finished difference Result 287694 states and 391288 transitions. [2021-01-06 19:27:07,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:07,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2021-01-06 19:27:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:07,272 INFO L225 Difference]: With dead ends: 287694 [2021-01-06 19:27:07,272 INFO L226 Difference]: Without dead ends: 161410 [2021-01-06 19:27:07,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:27:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161410 states. [2021-01-06 19:27:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161410 to 161410. [2021-01-06 19:27:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161410 states. [2021-01-06 19:27:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161410 states to 161410 states and 220229 transitions. [2021-01-06 19:27:15,270 INFO L78 Accepts]: Start accepts. Automaton has 161410 states and 220229 transitions. Word has length 390 [2021-01-06 19:27:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:15,271 INFO L481 AbstractCegarLoop]: Abstraction has 161410 states and 220229 transitions. [2021-01-06 19:27:15,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 161410 states and 220229 transitions. [2021-01-06 19:27:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2021-01-06 19:27:15,759 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:15,761 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:15,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:27:15,980 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:15,981 INFO L82 PathProgramCache]: Analyzing trace with hash 225683825, now seen corresponding path program 1 times [2021-01-06 19:27:15,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:15,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85726210] [2021-01-06 19:27:15,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-01-06 19:27:16,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85726210] [2021-01-06 19:27:16,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663789618] [2021-01-06 19:27:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:27:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:16,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 19:27:16,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:27:16,693 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2021-01-06 19:27:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:27:17,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:27:17,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 19:27:17,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059206949] [2021-01-06 19:27:17,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:17,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:17,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:17,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:17,028 INFO L87 Difference]: Start difference. First operand 161410 states and 220229 transitions. Second operand 3 states. [2021-01-06 19:27:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:23,830 INFO L93 Difference]: Finished difference Result 318569 states and 435153 transitions. [2021-01-06 19:27:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:23,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2021-01-06 19:27:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:24,014 INFO L225 Difference]: With dead ends: 318569 [2021-01-06 19:27:24,014 INFO L226 Difference]: Without dead ends: 161410 [2021-01-06 19:27:24,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161410 states. [2021-01-06 19:27:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161410 to 161410. [2021-01-06 19:27:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161410 states. [2021-01-06 19:27:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161410 states to 161410 states and 218469 transitions. [2021-01-06 19:27:31,962 INFO L78 Accepts]: Start accepts. Automaton has 161410 states and 218469 transitions. Word has length 417 [2021-01-06 19:27:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:31,963 INFO L481 AbstractCegarLoop]: Abstraction has 161410 states and 218469 transitions. [2021-01-06 19:27:31,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 161410 states and 218469 transitions. [2021-01-06 19:27:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2021-01-06 19:27:32,082 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:32,082 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:32,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-01-06 19:27:32,296 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:32,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:32,297 INFO L82 PathProgramCache]: Analyzing trace with hash -193413711, now seen corresponding path program 1 times [2021-01-06 19:27:32,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:32,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481581095] [2021-01-06 19:27:32,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-01-06 19:27:32,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481581095] [2021-01-06 19:27:32,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670410434] [2021-01-06 19:27:32,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:27:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:33,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 19:27:33,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:27:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:27:33,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:27:33,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2021-01-06 19:27:33,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022177695] [2021-01-06 19:27:33,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:33,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:33,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:33,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:27:33,460 INFO L87 Difference]: Start difference. First operand 161410 states and 218469 transitions. Second operand 4 states. [2021-01-06 19:27:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:36,959 INFO L93 Difference]: Finished difference Result 237492 states and 321650 transitions. [2021-01-06 19:27:36,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:27:36,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 417 [2021-01-06 19:27:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:37,048 INFO L225 Difference]: With dead ends: 237492 [2021-01-06 19:27:37,048 INFO L226 Difference]: Without dead ends: 84603 [2021-01-06 19:27:37,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:27:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84603 states.