/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/toy.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:35:08,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:35:08,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:35:08,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:35:08,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:35:08,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:35:08,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:35:08,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:35:08,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:35:08,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:35:08,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:35:08,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:35:08,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:35:08,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:35:08,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:35:08,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:35:08,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:35:08,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:35:08,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:35:08,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:35:08,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:35:08,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:35:08,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:35:08,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:35:08,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:35:08,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:35:08,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:35:08,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:35:08,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:35:08,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:35:08,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:35:08,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:35:08,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:35:08,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:35:08,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:35:08,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:35:08,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:35:08,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:35:08,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:35:08,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:35:08,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:35:08,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:35:08,625 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:35:08,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:35:08,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:35:08,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:35:08,631 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:35:08,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:35:08,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:35:08,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:35:08,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:35:08,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:35:08,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:35:08,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:35:08,634 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:35:08,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:35:08,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:35:08,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:35:08,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:35:08,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:35:08,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:35:08,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:35:08,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:35:08,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:35:08,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:35:08,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:35:08,637 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:35:08,637 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 09:35:09,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:35:09,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:35:09,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:35:09,132 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:35:09,133 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:35:09,134 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2020-12-23 09:35:09,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71a887f52/bada51488daf4720ab500b5a537b2cd0/FLAGaab0dedf2 [2020-12-23 09:35:09,935 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:35:09,936 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2020-12-23 09:35:09,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71a887f52/bada51488daf4720ab500b5a537b2cd0/FLAGaab0dedf2 [2020-12-23 09:35:10,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71a887f52/bada51488daf4720ab500b5a537b2cd0 [2020-12-23 09:35:10,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:35:10,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:35:10,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:35:10,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:35:10,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:35:10,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:35:10" (1/1) ... [2020-12-23 09:35:10,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d45929d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10, skipping insertion in model container [2020-12-23 09:35:10,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:35:10" (1/1) ... [2020-12-23 09:35:10,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:35:10,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:35:10,500 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/toy.cil.c[392,405] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~processed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t_b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~processed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~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[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2020-12-23 09:35:10,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:35:10,601 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:35:10,614 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/toy.cil.c[392,405] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~processed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t_b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~processed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~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[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_wl~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_f~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~e_e~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wb_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~wl_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2020-12-23 09:35:10,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:35:10,697 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:35:10,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10 WrapperNode [2020-12-23 09:35:10,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:35:10,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:35:10,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:35:10,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:35:10,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10" (1/1) ... [2020-12-23 09:35:10,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10" (1/1) ... [2020-12-23 09:35:10,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:35:10,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:35:10,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:35:10,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:35:10,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10" (1/1) ... [2020-12-23 09:35:10,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10" (1/1) ... [2020-12-23 09:35:10,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10" (1/1) ... [2020-12-23 09:35:10,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10" (1/1) ... [2020-12-23 09:35:10,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10" (1/1) ... [2020-12-23 09:35:10,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10" (1/1) ... [2020-12-23 09:35:10,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10" (1/1) ... [2020-12-23 09:35:10,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:35:10,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:35:10,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:35:10,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:35:10,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:35:10,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:35:10,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:35:10,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:35:10,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:35:11,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:35:11,771 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2020-12-23 09:35:11,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:35:11 BoogieIcfgContainer [2020-12-23 09:35:11,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:35:11,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:35:11,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:35:11,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:35:11,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:35:10" (1/3) ... [2020-12-23 09:35:11,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fbd510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:35:11, skipping insertion in model container [2020-12-23 09:35:11,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:10" (2/3) ... [2020-12-23 09:35:11,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fbd510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:35:11, skipping insertion in model container [2020-12-23 09:35:11,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:35:11" (3/3) ... [2020-12-23 09:35:11,785 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2020-12-23 09:35:11,794 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:35:11,801 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:35:11,827 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:35:11,863 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:35:11,863 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:35:11,864 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:35:11,864 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:35:11,864 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:35:11,864 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:35:11,864 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:35:11,865 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:35:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2020-12-23 09:35:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:11,899 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:11,900 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] [2020-12-23 09:35:11,901 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2020-12-23 09:35:11,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:11,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517283073] [2020-12-23 09:35:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:12,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517283073] [2020-12-23 09:35:12,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:12,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:12,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562910457] [2020-12-23 09:35:12,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:12,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:12,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:12,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:12,257 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2020-12-23 09:35:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:12,358 INFO L93 Difference]: Finished difference Result 244 states and 453 transitions. [2020-12-23 09:35:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:12,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-23 09:35:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:12,396 INFO L225 Difference]: With dead ends: 244 [2020-12-23 09:35:12,397 INFO L226 Difference]: Without dead ends: 122 [2020-12-23 09:35:12,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-12-23 09:35:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-12-23 09:35:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-12-23 09:35:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2020-12-23 09:35:12,466 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 36 [2020-12-23 09:35:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:12,467 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 215 transitions. [2020-12-23 09:35:12,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions. [2020-12-23 09:35:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:12,469 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:12,470 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] [2020-12-23 09:35:12,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:35:12,470 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:12,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:12,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2020-12-23 09:35:12,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:12,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648766527] [2020-12-23 09:35:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:12,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648766527] [2020-12-23 09:35:12,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:12,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:12,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404086089] [2020-12-23 09:35:12,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:12,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:12,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:12,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:12,569 INFO L87 Difference]: Start difference. First operand 122 states and 215 transitions. Second operand 4 states. [2020-12-23 09:35:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:12,691 INFO L93 Difference]: Finished difference Result 328 states and 577 transitions. [2020-12-23 09:35:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:12,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:12,695 INFO L225 Difference]: With dead ends: 328 [2020-12-23 09:35:12,695 INFO L226 Difference]: Without dead ends: 209 [2020-12-23 09:35:12,697 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 [2020-12-23 09:35:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-12-23 09:35:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2020-12-23 09:35:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-23 09:35:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 361 transitions. [2020-12-23 09:35:12,729 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 361 transitions. Word has length 36 [2020-12-23 09:35:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:12,729 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 361 transitions. [2020-12-23 09:35:12,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 361 transitions. [2020-12-23 09:35:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:12,731 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:12,732 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] [2020-12-23 09:35:12,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:35:12,732 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:12,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:12,733 INFO L82 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2020-12-23 09:35:12,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:12,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991378451] [2020-12-23 09:35:12,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:12,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991378451] [2020-12-23 09:35:12,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:12,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:12,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050983842] [2020-12-23 09:35:12,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:12,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:12,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:12,816 INFO L87 Difference]: Start difference. First operand 206 states and 361 transitions. Second operand 3 states. [2020-12-23 09:35:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:12,892 INFO L93 Difference]: Finished difference Result 403 states and 709 transitions. [2020-12-23 09:35:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:12,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-23 09:35:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:12,896 INFO L225 Difference]: With dead ends: 403 [2020-12-23 09:35:12,898 INFO L226 Difference]: Without dead ends: 206 [2020-12-23 09:35:12,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-12-23 09:35:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2020-12-23 09:35:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-23 09:35:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 349 transitions. [2020-12-23 09:35:12,955 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 349 transitions. Word has length 36 [2020-12-23 09:35:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:12,956 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 349 transitions. [2020-12-23 09:35:12,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 349 transitions. [2020-12-23 09:35:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:12,957 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:12,958 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] [2020-12-23 09:35:12,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:35:12,958 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1741714488, now seen corresponding path program 1 times [2020-12-23 09:35:12,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:12,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972247697] [2020-12-23 09:35:12,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:13,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972247697] [2020-12-23 09:35:13,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:13,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:13,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565747215] [2020-12-23 09:35:13,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:13,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:13,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:13,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:13,064 INFO L87 Difference]: Start difference. First operand 206 states and 349 transitions. Second operand 4 states. [2020-12-23 09:35:13,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:13,175 INFO L93 Difference]: Finished difference Result 559 states and 950 transitions. [2020-12-23 09:35:13,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:13,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:13,180 INFO L225 Difference]: With dead ends: 559 [2020-12-23 09:35:13,181 INFO L226 Difference]: Without dead ends: 363 [2020-12-23 09:35:13,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-12-23 09:35:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 206. [2020-12-23 09:35:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-23 09:35:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 346 transitions. [2020-12-23 09:35:13,222 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 346 transitions. Word has length 36 [2020-12-23 09:35:13,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:13,223 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 346 transitions. [2020-12-23 09:35:13,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 346 transitions. [2020-12-23 09:35:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:13,227 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:13,227 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] [2020-12-23 09:35:13,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:35:13,228 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash 181513546, now seen corresponding path program 1 times [2020-12-23 09:35:13,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:13,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981499219] [2020-12-23 09:35:13,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:13,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981499219] [2020-12-23 09:35:13,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:13,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:13,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629681182] [2020-12-23 09:35:13,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:13,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:13,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:13,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:13,328 INFO L87 Difference]: Start difference. First operand 206 states and 346 transitions. Second operand 4 states. [2020-12-23 09:35:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:13,421 INFO L93 Difference]: Finished difference Result 562 states and 946 transitions. [2020-12-23 09:35:13,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:13,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:13,425 INFO L225 Difference]: With dead ends: 562 [2020-12-23 09:35:13,425 INFO L226 Difference]: Without dead ends: 367 [2020-12-23 09:35:13,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2020-12-23 09:35:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 206. [2020-12-23 09:35:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-23 09:35:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 343 transitions. [2020-12-23 09:35:13,440 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 343 transitions. Word has length 36 [2020-12-23 09:35:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:13,441 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 343 transitions. [2020-12-23 09:35:13,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 343 transitions. [2020-12-23 09:35:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:13,442 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:13,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:13,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:35:13,443 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:13,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:13,444 INFO L82 PathProgramCache]: Analyzing trace with hash 243553160, now seen corresponding path program 1 times [2020-12-23 09:35:13,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:13,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006027512] [2020-12-23 09:35:13,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:13,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006027512] [2020-12-23 09:35:13,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:13,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:13,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420702125] [2020-12-23 09:35:13,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:13,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:13,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:13,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:13,483 INFO L87 Difference]: Start difference. First operand 206 states and 343 transitions. Second operand 4 states. [2020-12-23 09:35:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:13,578 INFO L93 Difference]: Finished difference Result 574 states and 957 transitions. [2020-12-23 09:35:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:13,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:13,581 INFO L225 Difference]: With dead ends: 574 [2020-12-23 09:35:13,581 INFO L226 Difference]: Without dead ends: 380 [2020-12-23 09:35:13,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2020-12-23 09:35:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2020-12-23 09:35:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-12-23 09:35:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 347 transitions. [2020-12-23 09:35:13,597 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 347 transitions. Word has length 36 [2020-12-23 09:35:13,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:13,598 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 347 transitions. [2020-12-23 09:35:13,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 347 transitions. [2020-12-23 09:35:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:13,599 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:13,599 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] [2020-12-23 09:35:13,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:35:13,600 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:13,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:13,601 INFO L82 PathProgramCache]: Analyzing trace with hash 384101770, now seen corresponding path program 1 times [2020-12-23 09:35:13,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:13,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399121702] [2020-12-23 09:35:13,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:13,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399121702] [2020-12-23 09:35:13,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:13,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:13,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093792457] [2020-12-23 09:35:13,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:13,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:13,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:13,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:13,639 INFO L87 Difference]: Start difference. First operand 212 states and 347 transitions. Second operand 4 states. [2020-12-23 09:35:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:13,734 INFO L93 Difference]: Finished difference Result 721 states and 1181 transitions. [2020-12-23 09:35:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:13,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:13,738 INFO L225 Difference]: With dead ends: 721 [2020-12-23 09:35:13,739 INFO L226 Difference]: Without dead ends: 522 [2020-12-23 09:35:13,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-12-23 09:35:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 345. [2020-12-23 09:35:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-12-23 09:35:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 562 transitions. [2020-12-23 09:35:13,763 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 562 transitions. Word has length 36 [2020-12-23 09:35:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:13,763 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 562 transitions. [2020-12-23 09:35:13,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 562 transitions. [2020-12-23 09:35:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:13,764 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:13,764 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] [2020-12-23 09:35:13,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:35:13,765 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:13,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:13,765 INFO L82 PathProgramCache]: Analyzing trace with hash 250088264, now seen corresponding path program 1 times [2020-12-23 09:35:13,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:13,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693367363] [2020-12-23 09:35:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:13,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693367363] [2020-12-23 09:35:13,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:13,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:13,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275205976] [2020-12-23 09:35:13,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:13,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:13,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:13,801 INFO L87 Difference]: Start difference. First operand 345 states and 562 transitions. Second operand 3 states. [2020-12-23 09:35:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:13,851 INFO L93 Difference]: Finished difference Result 822 states and 1345 transitions. [2020-12-23 09:35:13,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:13,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-23 09:35:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:13,855 INFO L225 Difference]: With dead ends: 822 [2020-12-23 09:35:13,856 INFO L226 Difference]: Without dead ends: 501 [2020-12-23 09:35:13,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-12-23 09:35:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 499. [2020-12-23 09:35:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2020-12-23 09:35:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 812 transitions. [2020-12-23 09:35:13,889 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 812 transitions. Word has length 36 [2020-12-23 09:35:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:13,889 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 812 transitions. [2020-12-23 09:35:13,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 812 transitions. [2020-12-23 09:35:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:13,890 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:13,890 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] [2020-12-23 09:35:13,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:35:13,891 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:13,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1539793604, now seen corresponding path program 1 times [2020-12-23 09:35:13,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:13,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56867432] [2020-12-23 09:35:13,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:13,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56867432] [2020-12-23 09:35:13,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:13,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:13,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346145315] [2020-12-23 09:35:13,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:13,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:13,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:13,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:13,928 INFO L87 Difference]: Start difference. First operand 499 states and 812 transitions. Second operand 4 states. [2020-12-23 09:35:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:14,026 INFO L93 Difference]: Finished difference Result 1271 states and 2069 transitions. [2020-12-23 09:35:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:14,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:14,031 INFO L225 Difference]: With dead ends: 1271 [2020-12-23 09:35:14,032 INFO L226 Difference]: Without dead ends: 789 [2020-12-23 09:35:14,033 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 [2020-12-23 09:35:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2020-12-23 09:35:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 499. [2020-12-23 09:35:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2020-12-23 09:35:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 804 transitions. [2020-12-23 09:35:14,093 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 804 transitions. Word has length 36 [2020-12-23 09:35:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:14,094 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 804 transitions. [2020-12-23 09:35:14,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 804 transitions. [2020-12-23 09:35:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:14,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:14,095 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] [2020-12-23 09:35:14,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:35:14,095 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash -48554298, now seen corresponding path program 1 times [2020-12-23 09:35:14,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:14,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010483773] [2020-12-23 09:35:14,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:14,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010483773] [2020-12-23 09:35:14,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:14,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:14,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99064107] [2020-12-23 09:35:14,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:14,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:14,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:14,132 INFO L87 Difference]: Start difference. First operand 499 states and 804 transitions. Second operand 4 states. [2020-12-23 09:35:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:14,239 INFO L93 Difference]: Finished difference Result 1267 states and 2042 transitions. [2020-12-23 09:35:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:14,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:14,245 INFO L225 Difference]: With dead ends: 1267 [2020-12-23 09:35:14,245 INFO L226 Difference]: Without dead ends: 791 [2020-12-23 09:35:14,247 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 [2020-12-23 09:35:14,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2020-12-23 09:35:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 499. [2020-12-23 09:35:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2020-12-23 09:35:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 796 transitions. [2020-12-23 09:35:14,285 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 796 transitions. Word has length 36 [2020-12-23 09:35:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:14,285 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 796 transitions. [2020-12-23 09:35:14,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 796 transitions. [2020-12-23 09:35:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:14,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:14,286 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] [2020-12-23 09:35:14,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:35:14,287 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:14,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:14,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1328417976, now seen corresponding path program 1 times [2020-12-23 09:35:14,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:14,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335210478] [2020-12-23 09:35:14,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:14,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335210478] [2020-12-23 09:35:14,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:14,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:14,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97542965] [2020-12-23 09:35:14,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:14,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:14,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:14,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:14,324 INFO L87 Difference]: Start difference. First operand 499 states and 796 transitions. Second operand 4 states. [2020-12-23 09:35:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:14,432 INFO L93 Difference]: Finished difference Result 1206 states and 1920 transitions. [2020-12-23 09:35:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:14,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 09:35:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:14,438 INFO L225 Difference]: With dead ends: 1206 [2020-12-23 09:35:14,438 INFO L226 Difference]: Without dead ends: 724 [2020-12-23 09:35:14,440 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 [2020-12-23 09:35:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2020-12-23 09:35:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 547. [2020-12-23 09:35:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-12-23 09:35:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 853 transitions. [2020-12-23 09:35:14,478 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 853 transitions. Word has length 36 [2020-12-23 09:35:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:14,478 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 853 transitions. [2020-12-23 09:35:14,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 853 transitions. [2020-12-23 09:35:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:35:14,479 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:14,479 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] [2020-12-23 09:35:14,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:35:14,480 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:14,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2020-12-23 09:35:14,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:14,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300715179] [2020-12-23 09:35:14,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:14,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300715179] [2020-12-23 09:35:14,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:14,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:14,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089894162] [2020-12-23 09:35:14,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:14,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:14,511 INFO L87 Difference]: Start difference. First operand 547 states and 853 transitions. Second operand 3 states. [2020-12-23 09:35:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:14,642 INFO L93 Difference]: Finished difference Result 1300 states and 2032 transitions. [2020-12-23 09:35:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:14,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-23 09:35:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:14,648 INFO L225 Difference]: With dead ends: 1300 [2020-12-23 09:35:14,648 INFO L226 Difference]: Without dead ends: 767 [2020-12-23 09:35:14,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2020-12-23 09:35:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 764. [2020-12-23 09:35:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2020-12-23 09:35:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1177 transitions. [2020-12-23 09:35:14,713 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1177 transitions. Word has length 36 [2020-12-23 09:35:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:14,713 INFO L481 AbstractCegarLoop]: Abstraction has 764 states and 1177 transitions. [2020-12-23 09:35:14,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1177 transitions. [2020-12-23 09:35:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 09:35:14,714 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:14,714 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:35:14,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:35:14,715 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:14,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1648654786, now seen corresponding path program 1 times [2020-12-23 09:35:14,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:14,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64375608] [2020-12-23 09:35:14,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:14,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64375608] [2020-12-23 09:35:14,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:14,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:14,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770977066] [2020-12-23 09:35:14,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:14,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:14,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:14,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:14,748 INFO L87 Difference]: Start difference. First operand 764 states and 1177 transitions. Second operand 3 states. [2020-12-23 09:35:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:14,841 INFO L93 Difference]: Finished difference Result 1882 states and 2939 transitions. [2020-12-23 09:35:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:14,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-23 09:35:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:14,848 INFO L225 Difference]: With dead ends: 1882 [2020-12-23 09:35:14,848 INFO L226 Difference]: Without dead ends: 1145 [2020-12-23 09:35:14,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2020-12-23 09:35:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1143. [2020-12-23 09:35:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states. [2020-12-23 09:35:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1776 transitions. [2020-12-23 09:35:14,940 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1776 transitions. Word has length 46 [2020-12-23 09:35:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:14,940 INFO L481 AbstractCegarLoop]: Abstraction has 1143 states and 1776 transitions. [2020-12-23 09:35:14,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1776 transitions. [2020-12-23 09:35:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 09:35:14,942 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:14,942 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:35:14,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:35:14,942 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:14,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:14,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1400508292, now seen corresponding path program 1 times [2020-12-23 09:35:14,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:14,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664616871] [2020-12-23 09:35:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:35:14,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664616871] [2020-12-23 09:35:14,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:14,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:14,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341048364] [2020-12-23 09:35:14,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:14,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:14,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:14,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:14,987 INFO L87 Difference]: Start difference. First operand 1143 states and 1776 transitions. Second operand 3 states. [2020-12-23 09:35:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:15,109 INFO L93 Difference]: Finished difference Result 2237 states and 3493 transitions. [2020-12-23 09:35:15,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:15,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-23 09:35:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:15,116 INFO L225 Difference]: With dead ends: 2237 [2020-12-23 09:35:15,117 INFO L226 Difference]: Without dead ends: 1121 [2020-12-23 09:35:15,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2020-12-23 09:35:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2020-12-23 09:35:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2020-12-23 09:35:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1749 transitions. [2020-12-23 09:35:15,213 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1749 transitions. Word has length 46 [2020-12-23 09:35:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:15,214 INFO L481 AbstractCegarLoop]: Abstraction has 1121 states and 1749 transitions. [2020-12-23 09:35:15,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1749 transitions. [2020-12-23 09:35:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-23 09:35:15,215 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:15,215 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:15,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:35:15,216 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:15,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 666181047, now seen corresponding path program 1 times [2020-12-23 09:35:15,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:15,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48856744] [2020-12-23 09:35:15,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:15,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48856744] [2020-12-23 09:35:15,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:15,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:15,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462570406] [2020-12-23 09:35:15,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:15,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:15,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:15,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:15,251 INFO L87 Difference]: Start difference. First operand 1121 states and 1749 transitions. Second operand 3 states. [2020-12-23 09:35:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:15,404 INFO L93 Difference]: Finished difference Result 2849 states and 4504 transitions. [2020-12-23 09:35:15,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:15,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-23 09:35:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:15,414 INFO L225 Difference]: With dead ends: 2849 [2020-12-23 09:35:15,414 INFO L226 Difference]: Without dead ends: 1755 [2020-12-23 09:35:15,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2020-12-23 09:35:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2020-12-23 09:35:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2020-12-23 09:35:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2759 transitions. [2020-12-23 09:35:15,574 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2759 transitions. Word has length 47 [2020-12-23 09:35:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:15,574 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2759 transitions. [2020-12-23 09:35:15,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2759 transitions. [2020-12-23 09:35:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 09:35:15,576 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:15,576 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:35:15,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:35:15,577 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:15,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:15,577 INFO L82 PathProgramCache]: Analyzing trace with hash -656218967, now seen corresponding path program 1 times [2020-12-23 09:35:15,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:15,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908617214] [2020-12-23 09:35:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:15,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908617214] [2020-12-23 09:35:15,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:15,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:15,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310627317] [2020-12-23 09:35:15,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:15,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:15,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:15,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:15,612 INFO L87 Difference]: Start difference. First operand 1753 states and 2759 transitions. Second operand 3 states. [2020-12-23 09:35:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:15,891 INFO L93 Difference]: Finished difference Result 4716 states and 7517 transitions. [2020-12-23 09:35:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:15,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-23 09:35:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:15,909 INFO L225 Difference]: With dead ends: 4716 [2020-12-23 09:35:15,910 INFO L226 Difference]: Without dead ends: 2992 [2020-12-23 09:35:15,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-12-23 09:35:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2990. [2020-12-23 09:35:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2020-12-23 09:35:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 4746 transitions. [2020-12-23 09:35:16,210 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 4746 transitions. Word has length 48 [2020-12-23 09:35:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:16,210 INFO L481 AbstractCegarLoop]: Abstraction has 2990 states and 4746 transitions. [2020-12-23 09:35:16,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 4746 transitions. [2020-12-23 09:35:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 09:35:16,213 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:16,213 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:35:16,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:35:16,213 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:16,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:16,214 INFO L82 PathProgramCache]: Analyzing trace with hash -408072473, now seen corresponding path program 1 times [2020-12-23 09:35:16,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:16,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828762987] [2020-12-23 09:35:16,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:35:16,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828762987] [2020-12-23 09:35:16,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:16,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:16,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679532182] [2020-12-23 09:35:16,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:16,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:16,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:16,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:16,263 INFO L87 Difference]: Start difference. First operand 2990 states and 4746 transitions. Second operand 3 states. [2020-12-23 09:35:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:16,528 INFO L93 Difference]: Finished difference Result 5929 states and 9433 transitions. [2020-12-23 09:35:16,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:16,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-23 09:35:16,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:16,547 INFO L225 Difference]: With dead ends: 5929 [2020-12-23 09:35:16,547 INFO L226 Difference]: Without dead ends: 2968 [2020-12-23 09:35:16,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-12-23 09:35:16,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2020-12-23 09:35:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2020-12-23 09:35:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 4720 transitions. [2020-12-23 09:35:16,848 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 4720 transitions. Word has length 48 [2020-12-23 09:35:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:16,848 INFO L481 AbstractCegarLoop]: Abstraction has 2968 states and 4720 transitions. [2020-12-23 09:35:16,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 4720 transitions. [2020-12-23 09:35:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 09:35:16,850 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:16,850 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:35:16,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:35:16,851 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:16,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2128148300, now seen corresponding path program 1 times [2020-12-23 09:35:16,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:16,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309094043] [2020-12-23 09:35:16,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:16,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309094043] [2020-12-23 09:35:16,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:16,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:16,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216176851] [2020-12-23 09:35:16,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:16,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:16,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:16,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:16,892 INFO L87 Difference]: Start difference. First operand 2968 states and 4720 transitions. Second operand 4 states. [2020-12-23 09:35:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:17,362 INFO L93 Difference]: Finished difference Result 7517 states and 12005 transitions. [2020-12-23 09:35:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:17,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-23 09:35:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:17,386 INFO L225 Difference]: With dead ends: 7517 [2020-12-23 09:35:17,386 INFO L226 Difference]: Without dead ends: 3845 [2020-12-23 09:35:17,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2020-12-23 09:35:17,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3845. [2020-12-23 09:35:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3845 states. [2020-12-23 09:35:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6086 transitions. [2020-12-23 09:35:17,770 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6086 transitions. Word has length 49 [2020-12-23 09:35:17,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:17,770 INFO L481 AbstractCegarLoop]: Abstraction has 3845 states and 6086 transitions. [2020-12-23 09:35:17,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6086 transitions. [2020-12-23 09:35:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 09:35:17,773 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:17,773 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:35:17,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:35:17,774 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:17,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:17,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1609174737, now seen corresponding path program 1 times [2020-12-23 09:35:17,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:17,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631878201] [2020-12-23 09:35:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:17,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631878201] [2020-12-23 09:35:17,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:17,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:17,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919863903] [2020-12-23 09:35:17,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:17,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:17,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:17,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:17,855 INFO L87 Difference]: Start difference. First operand 3845 states and 6086 transitions. Second operand 5 states. [2020-12-23 09:35:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:18,500 INFO L93 Difference]: Finished difference Result 9812 states and 15418 transitions. [2020-12-23 09:35:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 09:35:18,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-12-23 09:35:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:18,536 INFO L225 Difference]: With dead ends: 9812 [2020-12-23 09:35:18,536 INFO L226 Difference]: Without dead ends: 5990 [2020-12-23 09:35:18,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:35:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2020-12-23 09:35:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 4496. [2020-12-23 09:35:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4496 states. [2020-12-23 09:35:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 6959 transitions. [2020-12-23 09:35:19,030 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 6959 transitions. Word has length 54 [2020-12-23 09:35:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:19,030 INFO L481 AbstractCegarLoop]: Abstraction has 4496 states and 6959 transitions. [2020-12-23 09:35:19,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 6959 transitions. [2020-12-23 09:35:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 09:35:19,034 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:19,035 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:19,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:35:19,035 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:19,067 INFO L82 PathProgramCache]: Analyzing trace with hash -605096400, now seen corresponding path program 1 times [2020-12-23 09:35:19,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:19,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250628957] [2020-12-23 09:35:19,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:19,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250628957] [2020-12-23 09:35:19,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:19,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:19,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298960227] [2020-12-23 09:35:19,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:19,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:19,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:19,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:19,108 INFO L87 Difference]: Start difference. First operand 4496 states and 6959 transitions. Second operand 3 states. [2020-12-23 09:35:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:19,487 INFO L93 Difference]: Finished difference Result 9315 states and 14384 transitions. [2020-12-23 09:35:19,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:19,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 09:35:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:19,506 INFO L225 Difference]: With dead ends: 9315 [2020-12-23 09:35:19,506 INFO L226 Difference]: Without dead ends: 4848 [2020-12-23 09:35:19,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4848 states. [2020-12-23 09:35:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4848 to 4816. [2020-12-23 09:35:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4816 states. [2020-12-23 09:35:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4816 states to 4816 states and 7208 transitions. [2020-12-23 09:35:19,952 INFO L78 Accepts]: Start accepts. Automaton has 4816 states and 7208 transitions. Word has length 86 [2020-12-23 09:35:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:19,952 INFO L481 AbstractCegarLoop]: Abstraction has 4816 states and 7208 transitions. [2020-12-23 09:35:19,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4816 states and 7208 transitions. [2020-12-23 09:35:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 09:35:19,957 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:19,957 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:19,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:35:19,958 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash 129921275, now seen corresponding path program 1 times [2020-12-23 09:35:19,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:19,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625332166] [2020-12-23 09:35:19,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:20,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625332166] [2020-12-23 09:35:20,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:20,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:20,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476936114] [2020-12-23 09:35:20,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:20,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:20,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:20,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:20,023 INFO L87 Difference]: Start difference. First operand 4816 states and 7208 transitions. Second operand 3 states. [2020-12-23 09:35:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:20,536 INFO L93 Difference]: Finished difference Result 10113 states and 15094 transitions. [2020-12-23 09:35:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:20,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-23 09:35:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:20,550 INFO L225 Difference]: With dead ends: 10113 [2020-12-23 09:35:20,550 INFO L226 Difference]: Without dead ends: 5338 [2020-12-23 09:35:20,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5338 states. [2020-12-23 09:35:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5338 to 5290. [2020-12-23 09:35:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5290 states. [2020-12-23 09:35:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7651 transitions. [2020-12-23 09:35:21,167 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7651 transitions. Word has length 87 [2020-12-23 09:35:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:21,167 INFO L481 AbstractCegarLoop]: Abstraction has 5290 states and 7651 transitions. [2020-12-23 09:35:21,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7651 transitions. [2020-12-23 09:35:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 09:35:21,175 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:21,175 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:21,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:35:21,176 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:21,177 INFO L82 PathProgramCache]: Analyzing trace with hash 793269102, now seen corresponding path program 1 times [2020-12-23 09:35:21,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:21,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103225862] [2020-12-23 09:35:21,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:21,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103225862] [2020-12-23 09:35:21,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:21,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:21,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975471890] [2020-12-23 09:35:21,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:21,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:21,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:21,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:21,226 INFO L87 Difference]: Start difference. First operand 5290 states and 7651 transitions. Second operand 3 states. [2020-12-23 09:35:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:21,932 INFO L93 Difference]: Finished difference Result 10887 states and 15753 transitions. [2020-12-23 09:35:21,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:21,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-12-23 09:35:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:21,948 INFO L225 Difference]: With dead ends: 10887 [2020-12-23 09:35:21,948 INFO L226 Difference]: Without dead ends: 5658 [2020-12-23 09:35:21,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:21,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2020-12-23 09:35:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5076. [2020-12-23 09:35:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2020-12-23 09:35:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7021 transitions. [2020-12-23 09:35:22,433 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7021 transitions. Word has length 88 [2020-12-23 09:35:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:22,434 INFO L481 AbstractCegarLoop]: Abstraction has 5076 states and 7021 transitions. [2020-12-23 09:35:22,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7021 transitions. [2020-12-23 09:35:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 09:35:22,439 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:22,439 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:22,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:35:22,440 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:22,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash -831404099, now seen corresponding path program 1 times [2020-12-23 09:35:22,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:22,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940388155] [2020-12-23 09:35:22,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:35:22,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940388155] [2020-12-23 09:35:22,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:22,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:22,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926360275] [2020-12-23 09:35:22,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:22,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:22,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:22,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:22,496 INFO L87 Difference]: Start difference. First operand 5076 states and 7021 transitions. Second operand 4 states. [2020-12-23 09:35:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:23,151 INFO L93 Difference]: Finished difference Result 9480 states and 13045 transitions. [2020-12-23 09:35:23,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:23,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-12-23 09:35:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:23,162 INFO L225 Difference]: With dead ends: 9480 [2020-12-23 09:35:23,163 INFO L226 Difference]: Without dead ends: 4855 [2020-12-23 09:35:23,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2020-12-23 09:35:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 4741. [2020-12-23 09:35:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4741 states. [2020-12-23 09:35:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 6331 transitions. [2020-12-23 09:35:23,571 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 6331 transitions. Word has length 89 [2020-12-23 09:35:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:23,572 INFO L481 AbstractCegarLoop]: Abstraction has 4741 states and 6331 transitions. [2020-12-23 09:35:23,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 6331 transitions. [2020-12-23 09:35:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 09:35:23,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:23,585 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:23,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:35:23,585 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:23,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:23,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1827636855, now seen corresponding path program 1 times [2020-12-23 09:35:23,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:23,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624989929] [2020-12-23 09:35:23,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 09:35:23,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624989929] [2020-12-23 09:35:23,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:23,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:23,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248992263] [2020-12-23 09:35:23,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:23,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:23,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:23,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:23,634 INFO L87 Difference]: Start difference. First operand 4741 states and 6331 transitions. Second operand 3 states. [2020-12-23 09:35:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:23,972 INFO L93 Difference]: Finished difference Result 9037 states and 12059 transitions. [2020-12-23 09:35:23,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:23,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-23 09:35:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:23,983 INFO L225 Difference]: With dead ends: 9037 [2020-12-23 09:35:23,983 INFO L226 Difference]: Without dead ends: 4687 [2020-12-23 09:35:23,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-23 09:35:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4687. [2020-12-23 09:35:24,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4687 states. [2020-12-23 09:35:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 6225 transitions. [2020-12-23 09:35:24,555 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 6225 transitions. Word has length 116 [2020-12-23 09:35:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:24,555 INFO L481 AbstractCegarLoop]: Abstraction has 4687 states and 6225 transitions. [2020-12-23 09:35:24,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 6225 transitions. [2020-12-23 09:35:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 09:35:24,571 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:24,571 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:24,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:35:24,572 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:24,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1827087367, now seen corresponding path program 1 times [2020-12-23 09:35:24,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:24,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807768273] [2020-12-23 09:35:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 09:35:24,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807768273] [2020-12-23 09:35:24,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:24,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:24,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670580427] [2020-12-23 09:35:24,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:24,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:24,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:24,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:24,672 INFO L87 Difference]: Start difference. First operand 4687 states and 6225 transitions. Second operand 4 states. [2020-12-23 09:35:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:25,357 INFO L93 Difference]: Finished difference Result 8325 states and 11081 transitions. [2020-12-23 09:35:25,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:25,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2020-12-23 09:35:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:25,374 INFO L225 Difference]: With dead ends: 8325 [2020-12-23 09:35:25,375 INFO L226 Difference]: Without dead ends: 4607 [2020-12-23 09:35:25,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4607 states. [2020-12-23 09:35:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4607 to 4605. [2020-12-23 09:35:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2020-12-23 09:35:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6004 transitions. [2020-12-23 09:35:25,956 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6004 transitions. Word has length 128 [2020-12-23 09:35:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:25,956 INFO L481 AbstractCegarLoop]: Abstraction has 4605 states and 6004 transitions. [2020-12-23 09:35:25,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6004 transitions. [2020-12-23 09:35:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 09:35:25,969 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:25,969 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:25,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:35:25,970 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash 210660645, now seen corresponding path program 1 times [2020-12-23 09:35:25,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:25,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130515505] [2020-12-23 09:35:25,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-23 09:35:26,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130515505] [2020-12-23 09:35:26,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:26,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:26,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551327788] [2020-12-23 09:35:26,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:26,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:26,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:26,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:26,053 INFO L87 Difference]: Start difference. First operand 4605 states and 6004 transitions. Second operand 3 states. [2020-12-23 09:35:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:26,407 INFO L93 Difference]: Finished difference Result 8823 states and 11496 transitions. [2020-12-23 09:35:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:26,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-12-23 09:35:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:26,418 INFO L225 Difference]: With dead ends: 8823 [2020-12-23 09:35:26,418 INFO L226 Difference]: Without dead ends: 4604 [2020-12-23 09:35:26,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2020-12-23 09:35:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 4564. [2020-12-23 09:35:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4564 states. [2020-12-23 09:35:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 5921 transitions. [2020-12-23 09:35:26,871 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 5921 transitions. Word has length 134 [2020-12-23 09:35:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:26,871 INFO L481 AbstractCegarLoop]: Abstraction has 4564 states and 5921 transitions. [2020-12-23 09:35:26,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 5921 transitions. [2020-12-23 09:35:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 09:35:26,884 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:26,884 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:26,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:35:26,884 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:26,885 INFO L82 PathProgramCache]: Analyzing trace with hash 80634053, now seen corresponding path program 1 times [2020-12-23 09:35:26,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:26,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734330337] [2020-12-23 09:35:26,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-23 09:35:26,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734330337] [2020-12-23 09:35:26,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:26,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:26,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078236147] [2020-12-23 09:35:26,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:26,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:26,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:26,940 INFO L87 Difference]: Start difference. First operand 4564 states and 5921 transitions. Second operand 3 states. [2020-12-23 09:35:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:27,418 INFO L93 Difference]: Finished difference Result 8762 states and 11357 transitions. [2020-12-23 09:35:27,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:27,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-12-23 09:35:27,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:27,430 INFO L225 Difference]: With dead ends: 8762 [2020-12-23 09:35:27,430 INFO L226 Difference]: Without dead ends: 4574 [2020-12-23 09:35:27,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2020-12-23 09:35:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4534. [2020-12-23 09:35:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4534 states. [2020-12-23 09:35:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 5850 transitions. [2020-12-23 09:35:27,826 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 5850 transitions. Word has length 134 [2020-12-23 09:35:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:27,826 INFO L481 AbstractCegarLoop]: Abstraction has 4534 states and 5850 transitions. [2020-12-23 09:35:27,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 5850 transitions. [2020-12-23 09:35:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-23 09:35:27,838 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:27,838 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:27,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:35:27,838 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:27,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:27,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1507420786, now seen corresponding path program 1 times [2020-12-23 09:35:27,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:27,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884280309] [2020-12-23 09:35:27,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 09:35:27,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884280309] [2020-12-23 09:35:27,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:27,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:27,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810405602] [2020-12-23 09:35:27,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:27,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:27,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:27,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:27,898 INFO L87 Difference]: Start difference. First operand 4534 states and 5850 transitions. Second operand 4 states. [2020-12-23 09:35:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:28,201 INFO L93 Difference]: Finished difference Result 7387 states and 9578 transitions. [2020-12-23 09:35:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:28,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-12-23 09:35:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:28,210 INFO L225 Difference]: With dead ends: 7387 [2020-12-23 09:35:28,210 INFO L226 Difference]: Without dead ends: 3225 [2020-12-23 09:35:28,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2020-12-23 09:35:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3223. [2020-12-23 09:35:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3223 states. [2020-12-23 09:35:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4052 transitions. [2020-12-23 09:35:28,535 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4052 transitions. Word has length 137 [2020-12-23 09:35:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:28,535 INFO L481 AbstractCegarLoop]: Abstraction has 3223 states and 4052 transitions. [2020-12-23 09:35:28,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4052 transitions. [2020-12-23 09:35:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-23 09:35:28,541 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:28,542 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:28,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:35:28,542 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:28,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:28,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1526376893, now seen corresponding path program 1 times [2020-12-23 09:35:28,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:28,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591174335] [2020-12-23 09:35:28,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 09:35:28,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591174335] [2020-12-23 09:35:28,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:28,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:28,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497912456] [2020-12-23 09:35:28,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:28,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:28,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:28,601 INFO L87 Difference]: Start difference. First operand 3223 states and 4052 transitions. Second operand 4 states. [2020-12-23 09:35:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:28,795 INFO L93 Difference]: Finished difference Result 5208 states and 6552 transitions. [2020-12-23 09:35:28,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:28,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-12-23 09:35:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:28,799 INFO L225 Difference]: With dead ends: 5208 [2020-12-23 09:35:28,799 INFO L226 Difference]: Without dead ends: 2057 [2020-12-23 09:35:28,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2020-12-23 09:35:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2055. [2020-12-23 09:35:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2020-12-23 09:35:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2514 transitions. [2020-12-23 09:35:29,026 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2514 transitions. Word has length 137 [2020-12-23 09:35:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:29,027 INFO L481 AbstractCegarLoop]: Abstraction has 2055 states and 2514 transitions. [2020-12-23 09:35:29,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2514 transitions. [2020-12-23 09:35:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 09:35:29,034 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:29,035 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 09:35:29,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:35:29,035 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:29,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1143751876, now seen corresponding path program 1 times [2020-12-23 09:35:29,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:29,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673673717] [2020-12-23 09:35:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 09:35:29,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673673717] [2020-12-23 09:35:29,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:29,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:29,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371033217] [2020-12-23 09:35:29,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:29,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:29,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:29,146 INFO L87 Difference]: Start difference. First operand 2055 states and 2514 transitions. Second operand 3 states. [2020-12-23 09:35:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:29,364 INFO L93 Difference]: Finished difference Result 3727 states and 4591 transitions. [2020-12-23 09:35:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:29,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-12-23 09:35:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:29,370 INFO L225 Difference]: With dead ends: 3727 [2020-12-23 09:35:29,370 INFO L226 Difference]: Without dead ends: 2013 [2020-12-23 09:35:29,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2020-12-23 09:35:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1935. [2020-12-23 09:35:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2020-12-23 09:35:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2336 transitions. [2020-12-23 09:35:29,571 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2336 transitions. Word has length 176 [2020-12-23 09:35:29,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:29,571 INFO L481 AbstractCegarLoop]: Abstraction has 1935 states and 2336 transitions. [2020-12-23 09:35:29,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2336 transitions. [2020-12-23 09:35:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-23 09:35:29,574 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:29,575 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 09:35:29,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 09:35:29,575 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash 709277431, now seen corresponding path program 1 times [2020-12-23 09:35:29,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:29,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437048601] [2020-12-23 09:35:29,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 09:35:29,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437048601] [2020-12-23 09:35:29,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:29,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:29,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744719602] [2020-12-23 09:35:29,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:29,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:29,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:29,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:29,638 INFO L87 Difference]: Start difference. First operand 1935 states and 2336 transitions. Second operand 3 states. [2020-12-23 09:35:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:29,901 INFO L93 Difference]: Finished difference Result 4164 states and 5063 transitions. [2020-12-23 09:35:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:29,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-12-23 09:35:29,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:29,907 INFO L225 Difference]: With dead ends: 4164 [2020-12-23 09:35:29,907 INFO L226 Difference]: Without dead ends: 2566 [2020-12-23 09:35:29,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2020-12-23 09:35:30,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2213. [2020-12-23 09:35:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2020-12-23 09:35:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2636 transitions. [2020-12-23 09:35:30,297 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2636 transitions. Word has length 182 [2020-12-23 09:35:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:30,298 INFO L481 AbstractCegarLoop]: Abstraction has 2213 states and 2636 transitions. [2020-12-23 09:35:30,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2636 transitions. [2020-12-23 09:35:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-23 09:35:30,304 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:30,305 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 09:35:30,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 09:35:30,305 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:30,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:30,306 INFO L82 PathProgramCache]: Analyzing trace with hash 391755360, now seen corresponding path program 1 times [2020-12-23 09:35:30,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:30,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547875332] [2020-12-23 09:35:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 09:35:30,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547875332] [2020-12-23 09:35:30,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580642298] [2020-12-23 09:35:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:35:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:30,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-23 09:35:31,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:35:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 09:35:31,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:35:31,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-12-23 09:35:31,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967327234] [2020-12-23 09:35:31,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 09:35:31,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:31,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 09:35:31,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:35:31,599 INFO L87 Difference]: Start difference. First operand 2213 states and 2636 transitions. Second operand 19 states. [2020-12-23 09:35:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:33,391 INFO L93 Difference]: Finished difference Result 7188 states and 8534 transitions. [2020-12-23 09:35:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-23 09:35:33,391 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 185 [2020-12-23 09:35:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:33,402 INFO L225 Difference]: With dead ends: 7188 [2020-12-23 09:35:33,402 INFO L226 Difference]: Without dead ends: 5299 [2020-12-23 09:35:33,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=1569, Unknown=0, NotChecked=0, Total=1806 [2020-12-23 09:35:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2020-12-23 09:35:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 2902. [2020-12-23 09:35:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2902 states. [2020-12-23 09:35:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 3449 transitions. [2020-12-23 09:35:33,785 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 3449 transitions. Word has length 185 [2020-12-23 09:35:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:33,786 INFO L481 AbstractCegarLoop]: Abstraction has 2902 states and 3449 transitions. [2020-12-23 09:35:33,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 09:35:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 3449 transitions. [2020-12-23 09:35:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-12-23 09:35:33,790 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:33,790 INFO L422 BasicCegarLoop]: trace histogram [7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 09:35:34,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-12-23 09:35:34,005 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1085364486, now seen corresponding path program 1 times [2020-12-23 09:35:34,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:34,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031396669] [2020-12-23 09:35:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 09:35:34,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031396669] [2020-12-23 09:35:34,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148466570] [2020-12-23 09:35:34,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:35:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:34,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 09:35:34,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:35:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 09:35:34,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:35:34,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-12-23 09:35:34,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750966087] [2020-12-23 09:35:34,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 09:35:34,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:34,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 09:35:34,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-12-23 09:35:34,947 INFO L87 Difference]: Start difference. First operand 2902 states and 3449 transitions. Second operand 10 states. [2020-12-23 09:35:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:36,034 INFO L93 Difference]: Finished difference Result 6480 states and 7693 transitions. [2020-12-23 09:35:36,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 09:35:36,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2020-12-23 09:35:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:36,041 INFO L225 Difference]: With dead ends: 6480 [2020-12-23 09:35:36,042 INFO L226 Difference]: Without dead ends: 3902 [2020-12-23 09:35:36,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 191 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2020-12-23 09:35:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2020-12-23 09:35:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 3099. [2020-12-23 09:35:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3099 states. [2020-12-23 09:35:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 3672 transitions. [2020-12-23 09:35:36,488 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 3672 transitions. Word has length 191 [2020-12-23 09:35:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:36,489 INFO L481 AbstractCegarLoop]: Abstraction has 3099 states and 3672 transitions. [2020-12-23 09:35:36,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 09:35:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 3672 transitions. [2020-12-23 09:35:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2020-12-23 09:35:36,495 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:36,495 INFO L422 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2020-12-23 09:35:36,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:35:36,709 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:36,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:36,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1258410680, now seen corresponding path program 1 times [2020-12-23 09:35:36,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:36,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434422975] [2020-12-23 09:35:36,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-12-23 09:35:36,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434422975] [2020-12-23 09:35:36,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:36,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:36,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383871474] [2020-12-23 09:35:36,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:36,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:36,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:36,803 INFO L87 Difference]: Start difference. First operand 3099 states and 3672 transitions. Second operand 3 states. [2020-12-23 09:35:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:37,026 INFO L93 Difference]: Finished difference Result 4753 states and 5608 transitions. [2020-12-23 09:35:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:37,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2020-12-23 09:35:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:37,030 INFO L225 Difference]: With dead ends: 4753 [2020-12-23 09:35:37,030 INFO L226 Difference]: Without dead ends: 2114 [2020-12-23 09:35:37,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2020-12-23 09:35:37,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2081. [2020-12-23 09:35:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2020-12-23 09:35:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2408 transitions. [2020-12-23 09:35:37,306 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2408 transitions. Word has length 251 [2020-12-23 09:35:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:37,307 INFO L481 AbstractCegarLoop]: Abstraction has 2081 states and 2408 transitions. [2020-12-23 09:35:37,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:37,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2408 transitions. [2020-12-23 09:35:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2020-12-23 09:35:37,312 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:37,312 INFO L422 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2020-12-23 09:35:37,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 09:35:37,312 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:37,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:37,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2068647826, now seen corresponding path program 1 times [2020-12-23 09:35:37,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:37,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452418229] [2020-12-23 09:35:37,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-23 09:35:37,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452418229] [2020-12-23 09:35:37,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:37,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:37,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64780295] [2020-12-23 09:35:37,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:37,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:37,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:37,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:37,430 INFO L87 Difference]: Start difference. First operand 2081 states and 2408 transitions. Second operand 3 states. [2020-12-23 09:35:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:37,537 INFO L93 Difference]: Finished difference Result 2385 states and 2747 transitions. [2020-12-23 09:35:37,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:37,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2020-12-23 09:35:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:37,539 INFO L225 Difference]: With dead ends: 2385 [2020-12-23 09:35:37,539 INFO L226 Difference]: Without dead ends: 815 [2020-12-23 09:35:37,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2020-12-23 09:35:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2020-12-23 09:35:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2020-12-23 09:35:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 901 transitions. [2020-12-23 09:35:37,647 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 901 transitions. Word has length 275 [2020-12-23 09:35:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:37,648 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 901 transitions. [2020-12-23 09:35:37,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 901 transitions. [2020-12-23 09:35:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2020-12-23 09:35:37,652 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:37,652 INFO L422 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2020-12-23 09:35:37,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 09:35:37,653 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash 625161699, now seen corresponding path program 1 times [2020-12-23 09:35:37,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:37,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200141050] [2020-12-23 09:35:37,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2020-12-23 09:35:37,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200141050] [2020-12-23 09:35:37,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:37,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:37,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901043428] [2020-12-23 09:35:37,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:37,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:37,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:37,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:37,755 INFO L87 Difference]: Start difference. First operand 815 states and 901 transitions. Second operand 3 states. [2020-12-23 09:35:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:37,861 INFO L93 Difference]: Finished difference Result 1159 states and 1277 transitions. [2020-12-23 09:35:37,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:37,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2020-12-23 09:35:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:37,863 INFO L225 Difference]: With dead ends: 1159 [2020-12-23 09:35:37,863 INFO L226 Difference]: Without dead ends: 745 [2020-12-23 09:35:37,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2020-12-23 09:35:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 737. [2020-12-23 09:35:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2020-12-23 09:35:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 809 transitions. [2020-12-23 09:35:37,951 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 809 transitions. Word has length 277 [2020-12-23 09:35:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:37,951 INFO L481 AbstractCegarLoop]: Abstraction has 737 states and 809 transitions. [2020-12-23 09:35:37,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 809 transitions. [2020-12-23 09:35:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2020-12-23 09:35:37,953 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:37,954 INFO L422 BasicCegarLoop]: trace histogram [10, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2020-12-23 09:35:37,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 09:35:37,954 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:37,955 INFO L82 PathProgramCache]: Analyzing trace with hash -469819346, now seen corresponding path program 1 times [2020-12-23 09:35:37,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:37,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590793518] [2020-12-23 09:35:37,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 237 proven. 30 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2020-12-23 09:35:38,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590793518] [2020-12-23 09:35:38,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087052340] [2020-12-23 09:35:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:35:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:38,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 09:35:38,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:35:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 237 proven. 30 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2020-12-23 09:35:38,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:35:38,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-12-23 09:35:38,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080170051] [2020-12-23 09:35:38,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:35:38,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:38,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:35:38,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:35:38,783 INFO L87 Difference]: Start difference. First operand 737 states and 809 transitions. Second operand 9 states. [2020-12-23 09:35:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:39,143 INFO L93 Difference]: Finished difference Result 1053 states and 1149 transitions. [2020-12-23 09:35:39,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 09:35:39,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 289 [2020-12-23 09:35:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:39,144 INFO L225 Difference]: With dead ends: 1053 [2020-12-23 09:35:39,144 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 09:35:39,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:35:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 09:35:39,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 09:35:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 09:35:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 09:35:39,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 289 [2020-12-23 09:35:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:39,147 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 09:35:39,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:35:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 09:35:39,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 09:35:39,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-23 09:35:39,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 09:35:41,140 WARN L197 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 422 DAG size of output: 365 [2020-12-23 09:35:41,639 WARN L197 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 210 [2020-12-23 09:35:42,771 WARN L197 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 429 DAG size of output: 372 [2020-12-23 09:35:43,014 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 200 [2020-12-23 09:35:43,189 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 165 [2020-12-23 09:35:44,204 WARN L197 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 440 DAG size of output: 383 [2020-12-23 09:35:44,445 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 190 [2020-12-23 09:35:44,618 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 191 [2020-12-23 09:35:45,449 WARN L197 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 429 DAG size of output: 372 [2020-12-23 09:35:45,830 WARN L197 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 271 [2020-12-23 09:35:45,990 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 190 [2020-12-23 09:35:46,830 WARN L197 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 435 DAG size of output: 378 [2020-12-23 09:35:47,155 WARN L197 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 271 [2020-12-23 09:35:47,298 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 171 [2020-12-23 09:35:47,425 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 201 [2020-12-23 09:35:55,057 WARN L197 SmtUtils]: Spent 7.63 s on a formula simplification. DAG size of input: 357 DAG size of output: 164 [2020-12-23 09:35:56,655 WARN L197 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 202 DAG size of output: 87 [2020-12-23 09:36:06,151 WARN L197 SmtUtils]: Spent 9.49 s on a formula simplification. DAG size of input: 364 DAG size of output: 162 [2020-12-23 09:36:07,654 WARN L197 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2020-12-23 09:36:09,102 WARN L197 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 192 DAG size of output: 85 [2020-12-23 09:36:10,177 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 159 DAG size of output: 83 [2020-12-23 09:36:18,360 WARN L197 SmtUtils]: Spent 8.18 s on a formula simplification. DAG size of input: 375 DAG size of output: 165 [2020-12-23 09:36:19,018 WARN L197 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2020-12-23 09:36:20,001 WARN L197 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 84 [2020-12-23 09:36:22,048 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 183 DAG size of output: 111 [2020-12-23 09:36:22,427 WARN L197 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2020-12-23 09:36:31,964 WARN L197 SmtUtils]: Spent 9.53 s on a formula simplification. DAG size of input: 364 DAG size of output: 162 [2020-12-23 09:36:34,393 WARN L197 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 263 DAG size of output: 128 [2020-12-23 09:36:35,347 WARN L197 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 84 [2020-12-23 09:36:45,150 WARN L197 SmtUtils]: Spent 9.80 s on a formula simplification. DAG size of input: 370 DAG size of output: 163 [2020-12-23 09:36:47,505 WARN L197 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 263 DAG size of output: 128 [2020-12-23 09:36:48,497 WARN L197 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 83 [2020-12-23 09:36:49,806 WARN L197 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 193 DAG size of output: 116 [2020-12-23 09:36:49,811 INFO L189 CegarLoopUtils]: For program point L498(lines 498 502) no Hoare annotation was computed. [2020-12-23 09:36:49,813 INFO L185 CegarLoopUtils]: At program point L234-1(lines 222 249) the Hoare annotation is: (let ((.cse24 (= ~c2_st~0 0)) (.cse25 (= ~c1_st~0 0)) (.cse34 (+ ~t_b~0 1))) (let ((.cse8 (= ~c2_pc~0 0)) (.cse9 (not (= 2 ~wl_pc~0))) (.cse32 (<= ~c_t~0 .cse34)) (.cse33 (<= .cse34 ~c_t~0)) (.cse29 (= ~c1_pc~0 1)) (.cse30 (not (= ~r_st~0 0))) (.cse35 (= ~wb_pc~0 1)) (.cse36 (not .cse25)) (.cse12 (not (= 0 ~wl_st~0))) (.cse28 (= ~c2_pc~0 1)) (.cse0 (= ~processed~0 0)) (.cse1 (= ~r_st~0 ~e_f~0)) (.cse2 (not (= ~wb_st~0 0))) (.cse4 (= ~data~0 0)) (.cse3 (not (= ~e_wl~0 1))) (.cse5 (= ~c2_i~0 1)) (.cse6 (= ~t_b~0 0)) (.cse7 (= ~wb_pc~0 0)) (.cse31 (not .cse24)) (.cse10 (= ~wb_i~0 1)) (.cse11 (not (= ~e_c~0 0))) (.cse13 (= ~e_f~0 2)) (.cse14 (= ~d~0 0)) (.cse16 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= ~e_e~0 1))) (.cse19 (not (= ~r_i~0 1))) (.cse20 (= ~c1_pc~0 0)) (.cse21 (not (= ~e_g~0 0))) (.cse26 (not (= ~e_wl~0 0))) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (not (= ~e_e~0 0))) (.cse27 (= 0 ~wl_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse16 .cse3 .cse5 .cse17 .cse18 .cse19 .cse21 .cse26 .cse23 .cse10 .cse27 .cse11 .cse12 .cse13) (and .cse28 .cse16 .cse15 .cse2 .cse3 .cse29 .cse5 .cse30 .cse31 .cse32 .cse33 .cse17 .cse18 .cse19 .cse21 .cse26 (= ~data~0 .cse34) .cse35 .cse23 .cse10 .cse25 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse36 .cse24) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25) (and .cse28 .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse31 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse29 .cse17 .cse18 .cse19 .cse21 .cse26 .cse22 .cse23 .cse36 .cse27) (and .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22 .cse23 .cse24 .cse27 .cse25) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse36) (and .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse29 .cse17 .cse18 .cse19 .cse21 .cse26 .cse22 .cse23 .cse36 .cse24 .cse27) (and .cse28 .cse16 .cse3 .cse29 .cse5 .cse9 .cse17 .cse18 .cse19 .cse21 .cse35 .cse26 .cse23 .cse10 .cse11 .cse12 .cse13) (and .cse28 .cse16 .cse15 .cse2 .cse3 .cse29 .cse5 .cse30 .cse32 .cse33 .cse17 .cse18 .cse19 .cse21 .cse35 .cse26 .cse23 .cse36 .cse24 .cse10 (<= ~data~0 .cse34) (<= .cse34 ~data~0) .cse12 .cse13) (let ((.cse37 (+ ~t_b~0 2))) (and .cse28 .cse16 .cse15 .cse2 .cse3 .cse29 .cse5 .cse30 (= ~data~0 .cse37) .cse31 (= ~c_t~0 .cse37) .cse17 .cse18 .cse19 .cse21 .cse26 .cse35 .cse23 .cse36 .cse10 .cse12 .cse13)) (and .cse28 .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse31 .cse10 .cse11 .cse13 .cse14 .cse16 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22 .cse23 .cse27 .cse25)))) [2020-12-23 09:36:49,813 INFO L189 CegarLoopUtils]: For program point L631-1(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,813 INFO L189 CegarLoopUtils]: For program point L400(lines 400 410) no Hoare annotation was computed. [2020-12-23 09:36:49,814 INFO L189 CegarLoopUtils]: For program point L400-2(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,814 INFO L189 CegarLoopUtils]: For program point L301(lines 301 309) no Hoare annotation was computed. [2020-12-23 09:36:49,814 INFO L189 CegarLoopUtils]: For program point L235(line 235) no Hoare annotation was computed. [2020-12-23 09:36:49,814 INFO L189 CegarLoopUtils]: For program point L136(lines 136 140) no Hoare annotation was computed. [2020-12-23 09:36:49,814 INFO L189 CegarLoopUtils]: For program point L665(lines 665 673) no Hoare annotation was computed. [2020-12-23 09:36:49,814 INFO L189 CegarLoopUtils]: For program point L599(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,814 INFO L189 CegarLoopUtils]: For program point L566-1(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,815 INFO L189 CegarLoopUtils]: For program point L401(lines 401 406) no Hoare annotation was computed. [2020-12-23 09:36:49,815 INFO L189 CegarLoopUtils]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2020-12-23 09:36:49,815 INFO L185 CegarLoopUtils]: At program point L137(lines 132 172) the Hoare annotation is: (let ((.cse19 (+ ~t_b~0 1)) (.cse24 (= ~c2_st~0 0)) (.cse25 (= ~wb_st~0 0))) (let ((.cse10 (not (= ~e_c~0 0))) (.cse15 (not .cse25)) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse23 (= ~processed~0 0)) (.cse1 (not (= ~e_wl~0 1))) (.cse16 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse17 (not (= ~r_st~0 0))) (.cse18 (not .cse24)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse7 (not (= ~e_wl~0 0))) (.cse21 (= ~wb_pc~0 1)) (.cse20 (= ~data~0 .cse19)) (.cse8 (not (= ~e_e~0 0))) (.cse22 (not (= ~c1_st~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse15 .cse1 .cse16 .cse2 .cse17 .cse18 (<= ~c_t~0 .cse19) (<= .cse19 ~c_t~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse21 .cse8 .cse22 .cse9 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse16 .cse2 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ~data~0 ~t_b~0) .cse13 .cse0 .cse14 (<= ~t_b~0 ~data~0) .cse23 .cse15 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse1 .cse16 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse22 .cse24 .cse9 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse23 .cse1 .cse16 .cse2 .cse25 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse20 .cse8 .cse22 .cse9 .cse11 .cse12)))) [2020-12-23 09:36:49,816 INFO L185 CegarLoopUtils]: At program point L71(lines 57 127) the Hoare annotation is: (let ((.cse24 (= ~c1_st~0 0)) (.cse26 (= ~c2_st~0 0)) (.cse6 (= ~wb_st~0 0))) (let ((.cse25 (= ~c2_pc~0 0)) (.cse8 (= ~wb_pc~0 0)) (.cse20 (= ~c1_pc~0 0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (= ~processed~0 0)) (.cse2 (= ~r_st~0 ~e_f~0)) (.cse27 (not .cse6)) (.cse3 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse5 (= ~c2_i~0 1)) (.cse7 (= ~t_b~0 0)) (.cse9 (not .cse26)) (.cse10 (not (= 2 ~wl_pc~0))) (.cse28 (= ~wb_pc~0 1)) (.cse11 (= ~wb_i~0 1)) (.cse12 (not (= 0 ~wl_st~0))) (.cse13 (= ~e_f~0 2)) (.cse14 (= ~d~0 0)) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse29 (= ~c1_pc~0 1)) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= ~e_e~0 1))) (.cse19 (not (= ~r_i~0 1))) (.cse21 (not (= ~e_g~0 0))) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (not (= ~e_e~0 0))) (.cse30 (not .cse24))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26 .cse24) (and .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse25 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse30 .cse26) (and .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse25 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse30 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse30) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse30)))) [2020-12-23 09:36:49,816 INFO L189 CegarLoopUtils]: For program point L600(lines 600 604) no Hoare annotation was computed. [2020-12-23 09:36:49,816 INFO L185 CegarLoopUtils]: At program point L468(lines 461 478) the Hoare annotation is: (let ((.cse0 (= ~e_c~0 2)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse3 (= ~wb_st~0 0)) (.cse4 (= ~e_g~0 ~e_f~0)) (.cse5 (not (= ~r_i~0 1))) (.cse6 (= ~c_req_up~0 ~r_i~0)) (.cse7 (= ~c2_st~0 0)) (.cse8 (= ~wb_i~0 1)) (.cse9 (= 0 ~wl_pc~0)) (.cse10 (= ~e_e~0 ~e_c~0)) (.cse11 (= ~c1_st~0 0)) (.cse12 (= ~e_f~0 2)) (.cse13 (= ~e_wl~0 ~e_c~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ~wl_st~0)) .cse12 .cse13) (and .cse0 .cse1 (= ~processed~0 0) (= ~r_st~0 ~e_f~0) (= ~data~0 0) .cse2 .cse3 (= ~t_b~0 0) .cse4 (= ~wb_pc~0 0) (= ~c2_pc~0 0) .cse5 (= ~c1_pc~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~d~0 0) .cse13))) [2020-12-23 09:36:49,817 INFO L189 CegarLoopUtils]: For program point L469(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,817 INFO L189 CegarLoopUtils]: For program point L436-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,817 INFO L189 CegarLoopUtils]: For program point L304(lines 304 308) no Hoare annotation was computed. [2020-12-23 09:36:49,817 INFO L189 CegarLoopUtils]: For program point L304-1(lines 290 388) no Hoare annotation was computed. [2020-12-23 09:36:49,817 INFO L189 CegarLoopUtils]: For program point L668(lines 668 672) no Hoare annotation was computed. [2020-12-23 09:36:49,817 INFO L189 CegarLoopUtils]: For program point L668-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,817 INFO L189 CegarLoopUtils]: For program point L470(lines 470 474) no Hoare annotation was computed. [2020-12-23 09:36:49,817 INFO L189 CegarLoopUtils]: For program point L636-1(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,818 INFO L189 CegarLoopUtils]: For program point L538(line 538) no Hoare annotation was computed. [2020-12-23 09:36:49,818 INFO L189 CegarLoopUtils]: For program point L571-1(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,819 INFO L185 CegarLoopUtils]: At program point L373(lines 290 388) the Hoare annotation is: (let ((.cse25 (= ~c1_st~0 0)) (.cse50 (+ ~t_b~0 1)) (.cse23 (= ~c2_st~0 0)) (.cse5 (= ~wb_st~0 0)) (.cse53 (+ ~t_b~0 2))) (let ((.cse51 (= 2 ~wl_pc~0)) (.cse47 (= ~data~0 .cse53)) (.cse46 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse26 (= ~c2_pc~0 1)) (.cse13 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse34 (not .cse5)) (.cse3 (not (= ~e_wl~0 1))) (.cse27 (= ~c1_pc~0 1)) (.cse4 (= ~c2_i~0 1)) (.cse28 (not (= ~r_st~0 0))) (.cse35 (not .cse23)) (.cse15 (not (= ~e_g~0 1))) (.cse16 (not (= ~e_e~0 1))) (.cse17 (not (= ~r_i~0 1))) (.cse19 (not (= ~e_g~0 0))) (.cse52 (= ~data~0 .cse50)) (.cse20 (not (= ~e_wl~0 0))) (.cse29 (= ~wb_pc~0 1)) (.cse22 (not (= ~e_e~0 0))) (.cse30 (not .cse25)) (.cse9 (= ~wb_i~0 1)) (.cse33 (not (= 0 ~wl_st~0))) (.cse11 (= ~e_f~0 2))) (let ((.cse39 (<= .cse50 ~c~0)) (.cse40 (<= ~c~0 .cse50)) (.cse31 (<= ~data~0 .cse50)) (.cse32 (<= .cse50 ~data~0)) (.cse41 (<= ~c~0 1)) (.cse42 (or (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse47 .cse35 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse30 .cse9 .cse33 .cse11) (and (= ~data~0 ~t_b~0) .cse26 .cse13 .cse14 .cse34 .cse46 .cse3 .cse27 .cse4 .cse28 .cse35 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse30 .cse9 .cse33 .cse11) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse35 .cse15 .cse16 .cse17 .cse19 .cse52 .cse20 .cse29 .cse22 .cse30 .cse9 .cse33 .cse11))) (.cse43 (<= 1 ~c_t~0)) (.cse44 (<= 1 ~c~0)) (.cse45 (<= ~c_t~0 1)) (.cse24 (= 0 ~wl_pc~0)) (.cse7 (= ~wb_pc~0 0)) (.cse8 (= ~c2_pc~0 0)) (.cse18 (= ~c1_pc~0 0)) (.cse36 (<= ~c_t~0 .cse50)) (.cse37 (<= .cse50 ~c_t~0)) (.cse49 (= ~c~0 .cse53)) (.cse48 (= ~c_t~0 .cse53)) (.cse0 (= ~processed~0 0)) (.cse1 (= ~r_st~0 ~e_f~0)) (.cse2 (= ~data~0 0)) (.cse6 (= ~t_b~0 0)) (.cse38 (not .cse51)) (.cse10 (not (= ~e_c~0 0))) (.cse12 (= ~d~0 0)) (.cse21 (= ~c_req_up~0 ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse13 .cse14 .cse0 .cse3 .cse27 .cse4 .cse5 .cse28 .cse15 .cse16 .cse17 .cse19 .cse29 .cse20 .cse30 .cse22 .cse23 .cse9 .cse31 .cse32 .cse33 .cse11) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse30 .cse23 .cse24) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse35 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse21 .cse22 .cse30 .cse9 .cse10 .cse33 .cse11) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse36 .cse37 .cse15 .cse16 .cse17 .cse19 .cse29 .cse20 .cse22 .cse30 .cse9 .cse31 .cse32 .cse33 .cse11) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse38 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse27 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse30 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse2 .cse4 .cse6 .cse8 .cse38 .cse29 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25) (and .cse26 .cse34 .cse3 .cse4 .cse35 .cse36 .cse37 .cse29 .cse9 .cse33 .cse11 .cse13 .cse14 .cse27 .cse39 .cse15 .cse16 .cse17 .cse19 .cse40 .cse20 .cse30 .cse22 .cse31 .cse32) (and (<= ~d~0 1) .cse41 (<= 1 ~d~0) .cse42 .cse43 .cse44 .cse45 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse30 .cse23 .cse24) (and .cse26 .cse13 .cse3 .cse27 .cse4 .cse38 .cse15 .cse16 .cse17 .cse19 .cse29 .cse20 .cse22 .cse9 .cse10 .cse33 .cse11) (and (<= ~data~0 ~t_b~0) .cse26 .cse13 .cse14 (<= ~t_b~0 ~data~0) .cse0 .cse34 .cse46 .cse3 .cse27 .cse4 .cse28 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse23 .cse9 .cse25 .cse33 .cse11) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse47 .cse35 .cse48 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse30 .cse9 .cse33 .cse11) (and .cse26 .cse0 .cse1 .cse34 .cse3 .cse2 .cse4 .cse6 .cse35 .cse38 .cse29 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse25) (and .cse26 .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse35 .cse38 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse35 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse30 .cse24) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse49 .cse4 .cse47 .cse35 .cse48 .cse15 .cse16 .cse17 .cse19 .cse29 .cse20 .cse30 .cse22 .cse9 .cse33 .cse11) (and .cse26 .cse34 .cse3 .cse4 .cse35 (<= ~d~0 .cse50) .cse36 .cse37 .cse29 .cse9 .cse11 .cse13 .cse14 .cse27 .cse28 .cse39 (<= .cse50 ~d~0) .cse15 .cse16 .cse17 .cse51 .cse19 .cse20 .cse40 .cse22 .cse30 .cse31 .cse32) (and .cse13 .cse3 .cse4 .cse15 .cse16 .cse17 .cse19 .cse20 .cse22 .cse9 .cse24 .cse10 .cse33 .cse11) (and .cse26 .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse35 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse34 .cse3 .cse2 .cse4 .cse6 .cse35 .cse38 .cse29 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse27 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse30) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse35 .cse38 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse27 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse30) (and .cse26 .cse13 .cse14 .cse0 .cse3 .cse27 .cse4 .cse5 .cse28 .cse35 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse9 .cse31 .cse32 .cse25 .cse33 .cse11) (and .cse41 .cse42 .cse43 .cse44 .cse45 .cse6 .cse12) (and .cse0 .cse1 .cse34 .cse3 .cse2 .cse4 .cse6 .cse8 .cse38 .cse29 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse27 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse30 .cse23) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse35 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse38 .cse9 .cse10 .cse33 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse4 .cse28 .cse35 .cse36 .cse37 .cse15 .cse16 .cse17 .cse19 .cse20 .cse52 .cse29 .cse22 .cse9 .cse33 .cse11) (and .cse26 .cse13 .cse14 .cse34 .cse3 .cse27 .cse49 .cse4 (= ~d~0 .cse53) .cse28 .cse47 .cse35 .cse48 .cse15 .cse16 .cse17 .cse51 .cse19 .cse29 .cse20 .cse22 .cse30 .cse9 .cse11) (and .cse26 .cse13 .cse14 .cse0 .cse3 .cse27 .cse4 .cse5 .cse28 .cse47 .cse35 .cse15 .cse16 .cse17 .cse19 .cse20 .cse29 .cse22 .cse30 .cse9 .cse33 .cse11) (and .cse26 .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse35 .cse38 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse30))))) [2020-12-23 09:36:49,819 INFO L189 CegarLoopUtils]: For program point L506-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,819 INFO L189 CegarLoopUtils]: For program point L441-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,819 INFO L189 CegarLoopUtils]: For program point L111(lines 111 121) no Hoare annotation was computed. [2020-12-23 09:36:49,820 INFO L185 CegarLoopUtils]: At program point L343(lines 290 388) the Hoare annotation is: (let ((.cse35 (= ~c1_st~0 0)) (.cse46 (= 2 ~wl_pc~0)) (.cse33 (= ~c2_st~0 0)) (.cse26 (= ~wb_st~0 0)) (.cse47 (+ ~t_b~0 2)) (.cse45 (+ ~t_b~0 1))) (let ((.cse21 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse41 (<= .cse45 ~c~0)) (.cse42 (<= ~c~0 .cse45)) (.cse36 (<= ~data~0 .cse45)) (.cse37 (<= .cse45 ~data~0)) (.cse34 (= 0 ~wl_pc~0)) (.cse27 (= ~wb_pc~0 0)) (.cse28 (= ~c2_pc~0 0)) (.cse31 (= ~c1_pc~0 0)) (.cse38 (<= ~c_t~0 .cse45)) (.cse39 (<= .cse45 ~c_t~0)) (.cse43 (= ~c~0 .cse47)) (.cse44 (= ~c_t~0 .cse47)) (.cse7 (not (= ~r_st~0 0))) (.cse8 (= ~data~0 .cse47)) (.cse19 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse23 (= ~processed~0 0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse3 (not .cse26)) (.cse25 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse22 (= ~t_b~0 0)) (.cse9 (not .cse33)) (.cse40 (not .cse46)) (.cse15 (= ~wb_pc~0 1)) (.cse18 (= ~wb_i~0 1)) (.cse29 (not (= ~e_c~0 0))) (.cse20 (= ~e_f~0 2)) (.cse30 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse10 (not (= ~e_g~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~r_i~0 1))) (.cse13 (not (= ~e_g~0 0))) (.cse14 (not (= ~e_wl~0 0))) (.cse32 (= ~c_req_up~0 ~r_i~0)) (.cse16 (not (= ~e_e~0 0))) (.cse17 (not .cse35))) (or (and (<= ~d~0 1) (<= ~c~0 1) (<= 1 ~d~0) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (<= 1 ~c_t~0) (<= 1 ~c~0) (<= ~c_t~0 1) .cse22) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse33 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse3 .cse4 .cse6 .cse9 .cse38 .cse39 .cse15 .cse18 .cse19 .cse20 .cse1 .cse2 .cse5 .cse41 .cse10 .cse11 .cse12 .cse13 .cse42 .cse14 .cse17 .cse16 .cse36 .cse37) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse40 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse18 .cse29 .cse19 .cse20) (and (<= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 (<= ~t_b~0 ~data~0) .cse23 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33 .cse18 .cse35 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse3 .cse4 .cse6 .cse9 (<= ~d~0 .cse45) .cse38 .cse39 .cse15 .cse18 .cse20 .cse1 .cse2 .cse5 .cse7 .cse41 (<= .cse45 ~d~0) .cse10 .cse11 .cse12 .cse46 .cse13 .cse14 .cse42 .cse16 .cse17 .cse36 .cse37) (and .cse1 .cse4 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse34 .cse29 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse36 .cse37 .cse35 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~data~0 .cse45) .cse15 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 (= ~d~0 .cse47) .cse7 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse46 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17)))) [2020-12-23 09:36:49,821 INFO L189 CegarLoopUtils]: For program point L178(lines 178 186) no Hoare annotation was computed. [2020-12-23 09:36:49,821 INFO L189 CegarLoopUtils]: For program point L145(line 145) no Hoare annotation was computed. [2020-12-23 09:36:49,821 INFO L189 CegarLoopUtils]: For program point L608(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,821 INFO L189 CegarLoopUtils]: For program point L641-1(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,821 INFO L189 CegarLoopUtils]: For program point L377(lines 377 384) no Hoare annotation was computed. [2020-12-23 09:36:49,821 INFO L189 CegarLoopUtils]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-23 09:36:49,821 INFO L189 CegarLoopUtils]: For program point L609(lines 609 613) no Hoare annotation was computed. [2020-12-23 09:36:49,821 INFO L189 CegarLoopUtils]: For program point L576-1(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,822 INFO L189 CegarLoopUtils]: For program point L411-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,822 INFO L189 CegarLoopUtils]: For program point L114(lines 114 120) no Hoare annotation was computed. [2020-12-23 09:36:49,822 INFO L189 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2020-12-23 09:36:49,822 INFO L185 CegarLoopUtils]: At program point L709(lines 684 711) the Hoare annotation is: (= ~c2_i~0 1) [2020-12-23 09:36:49,822 INFO L189 CegarLoopUtils]: For program point L544(lines 544 554) no Hoare annotation was computed. [2020-12-23 09:36:49,822 INFO L189 CegarLoopUtils]: For program point L511-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,822 INFO L189 CegarLoopUtils]: For program point L544-2(lines 544 554) no Hoare annotation was computed. [2020-12-23 09:36:49,823 INFO L185 CegarLoopUtils]: At program point L313(lines 290 388) the Hoare annotation is: (let ((.cse35 (= ~c1_st~0 0)) (.cse46 (= 2 ~wl_pc~0)) (.cse33 (= ~c2_st~0 0)) (.cse26 (= ~wb_st~0 0)) (.cse47 (+ ~t_b~0 2)) (.cse45 (+ ~t_b~0 1))) (let ((.cse21 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse41 (<= .cse45 ~c~0)) (.cse42 (<= ~c~0 .cse45)) (.cse34 (= 0 ~wl_pc~0)) (.cse27 (= ~wb_pc~0 0)) (.cse28 (= ~c2_pc~0 0)) (.cse31 (= ~c1_pc~0 0)) (.cse43 (= ~c~0 .cse47)) (.cse44 (= ~c_t~0 .cse47)) (.cse39 (<= ~c_t~0 .cse45)) (.cse40 (<= .cse45 ~c_t~0)) (.cse36 (<= ~data~0 .cse45)) (.cse37 (<= .cse45 ~data~0)) (.cse7 (not (= ~r_st~0 0))) (.cse8 (= ~data~0 .cse47)) (.cse19 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse23 (= ~processed~0 0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse3 (not .cse26)) (.cse25 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse22 (= ~t_b~0 0)) (.cse9 (not .cse33)) (.cse38 (not .cse46)) (.cse15 (= ~wb_pc~0 1)) (.cse18 (= ~wb_i~0 1)) (.cse29 (not (= ~e_c~0 0))) (.cse20 (= ~e_f~0 2)) (.cse30 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse10 (not (= ~e_g~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~r_i~0 1))) (.cse13 (not (= ~e_g~0 0))) (.cse14 (not (= ~e_wl~0 0))) (.cse32 (= ~c_req_up~0 ~r_i~0)) (.cse16 (not (= ~e_e~0 0))) (.cse17 (not .cse35))) (or (and (<= ~d~0 1) (<= ~c~0 1) (<= 1 ~d~0) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (<= 1 ~c_t~0) (<= 1 ~c~0) (<= ~c_t~0 1) .cse22) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse33 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse38 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse38 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse3 .cse4 .cse6 .cse9 .cse39 .cse40 .cse15 .cse18 .cse19 .cse20 .cse1 .cse2 .cse5 .cse41 .cse10 .cse11 .cse12 .cse13 .cse42 .cse14 .cse17 .cse16 .cse36 .cse37) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse38 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse18 .cse29 .cse19 .cse20) (and (<= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 (<= ~t_b~0 ~data~0) .cse23 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33 .cse18 .cse35 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse38 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse38 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse3 .cse4 .cse6 .cse9 (<= ~d~0 .cse45) .cse39 .cse40 .cse15 .cse18 .cse20 .cse1 .cse2 .cse5 .cse7 .cse41 (<= .cse45 ~d~0) .cse10 .cse11 .cse12 .cse46 .cse13 .cse14 .cse42 .cse16 .cse17 .cse36 .cse37) (and .cse1 .cse4 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse34 .cse29 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse39 .cse40 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~data~0 .cse45) .cse15 .cse16 .cse18 .cse35 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse38 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse38 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse36 .cse37 .cse35 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse38 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse38 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 (= ~d~0 .cse47) .cse7 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse46 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse39 .cse40 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse17 .cse33 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse38 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17)))) [2020-12-23 09:36:49,824 INFO L189 CegarLoopUtils]: For program point L181(lines 181 185) no Hoare annotation was computed. [2020-12-23 09:36:49,824 INFO L185 CegarLoopUtils]: At program point L16(lines 57 127) the Hoare annotation is: (let ((.cse2 (= ~c2_pc~0 1)) (.cse3 (not (= ~wb_st~0 0))) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse13 (= ~wb_pc~0 1)) (.cse15 (= ~wb_i~0 1)) (.cse16 (not (= 0 ~wl_st~0))) (.cse17 (= ~e_f~0 2)) (.cse0 (= ~c1_i~0 1)) (.cse1 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse8 (not (= ~e_g~0 1))) (.cse9 (not (= ~e_e~0 1))) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_g~0 0))) (.cse12 (not (= ~e_wl~0 0))) (.cse14 (not (= ~e_e~0 0)))) (or (and (let ((.cse7 (not (= ~r_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~data~0 (+ ~t_b~0 2)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~data~0 (+ ~t_b~0 1)) .cse14 .cse15 .cse16 .cse17) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) (= 2 ~wl_pc~0)) (and .cse2 (= ~processed~0 0) (= ~r_st~0 ~e_f~0) .cse3 (= ~data~0 0) .cse4 .cse6 (= ~t_b~0 0) (not (= ~c2_st~0 0)) .cse13 .cse15 .cse16 .cse17 (= ~d~0 0) .cse0 .cse1 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~c_req_up~0 ~r_i~0) .cse14 (not (= ~c1_st~0 0))))) [2020-12-23 09:36:49,824 INFO L189 CegarLoopUtils]: For program point L545(lines 545 550) no Hoare annotation was computed. [2020-12-23 09:36:49,824 INFO L189 CegarLoopUtils]: For program point L479(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,824 INFO L189 CegarLoopUtils]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2020-12-23 09:36:49,825 INFO L189 CegarLoopUtils]: For program point L446-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,825 INFO L189 CegarLoopUtils]: For program point L347(lines 347 354) no Hoare annotation was computed. [2020-12-23 09:36:49,825 INFO L185 CegarLoopUtils]: At program point L182(lines 177 217) the Hoare annotation is: (let ((.cse24 (= ~wb_st~0 0)) (.cse25 (= ~c1_st~0 0)) (.cse19 (+ ~t_b~0 1))) (let ((.cse10 (not (= ~e_c~0 0))) (.cse20 (= ~data~0 .cse19)) (.cse22 (not .cse25)) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse23 (= ~processed~0 0)) (.cse15 (not .cse24)) (.cse1 (not (= ~e_wl~0 1))) (.cse16 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse17 (not (= ~r_st~0 0))) (.cse18 (not (= ~c2_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse7 (not (= ~e_wl~0 0))) (.cse21 (= ~wb_pc~0 1)) (.cse8 (not (= ~e_e~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse15 .cse1 .cse16 .cse2 .cse17 .cse18 (<= ~c_t~0 .cse19) (<= .cse19 ~c_t~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse21 .cse8 .cse22 .cse9 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse16 .cse2 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse23 .cse1 .cse16 .cse2 .cse24 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse20 .cse8 .cse22 .cse9 .cse11 .cse12) (and (<= ~data~0 ~t_b~0) .cse13 .cse0 .cse14 (<= ~t_b~0 ~data~0) .cse23 .cse15 .cse1 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse16 .cse2 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse25 .cse11 .cse12)))) [2020-12-23 09:36:49,825 INFO L185 CegarLoopUtils]: At program point L678(lines 395 683) the Hoare annotation is: (= ~c2_i~0 1) [2020-12-23 09:36:49,825 INFO L189 CegarLoopUtils]: For program point L480(lines 480 484) no Hoare annotation was computed. [2020-12-23 09:36:49,825 INFO L189 CegarLoopUtils]: For program point L646-1(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,826 INFO L185 CegarLoopUtils]: At program point L151-1(lines 132 172) the Hoare annotation is: (let ((.cse5 (= ~wb_st~0 0)) (.cse24 (= ~c2_st~0 0)) (.cse35 (+ ~t_b~0 1))) (let ((.cse7 (= ~wb_pc~0 0)) (.cse31 (<= ~data~0 .cse35)) (.cse32 (<= .cse35 ~data~0)) (.cse9 (not (= 2 ~wl_pc~0))) (.cse27 (= ~c2_pc~0 1)) (.cse28 (= ~c1_pc~0 1)) (.cse29 (not (= ~r_st~0 0))) (.cse34 (not .cse24)) (.cse12 (not (= 0 ~wl_st~0))) (.cse0 (= ~processed~0 0)) (.cse1 (= ~r_st~0 ~e_f~0)) (.cse33 (not .cse5)) (.cse2 (= ~data~0 0)) (.cse3 (not (= ~e_wl~0 1))) (.cse4 (= ~c2_i~0 1)) (.cse6 (= ~t_b~0 0)) (.cse8 (= ~c2_pc~0 0)) (.cse30 (= ~wb_pc~0 1)) (.cse10 (= ~wb_i~0 1)) (.cse11 (not (= ~e_c~0 0))) (.cse13 (= ~e_f~0 2)) (.cse14 (= ~d~0 0)) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= ~e_e~0 1))) (.cse19 (not (= ~r_i~0 1))) (.cse20 (not (= ~e_g~0 0))) (.cse25 (not (= ~e_wl~0 0))) (.cse21 (= ~c_req_up~0 ~r_i~0)) (.cse22 (not (= ~c1_st~0 0))) (.cse23 (not (= ~e_e~0 0))) (.cse26 (= 0 ~wl_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse15 .cse3 .cse4 .cse17 .cse18 .cse19 .cse20 .cse25 .cse23 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse27 .cse15 .cse16 .cse0 .cse3 .cse28 .cse4 .cse5 .cse29 .cse17 .cse18 .cse19 .cse20 .cse30 .cse25 .cse22 .cse23 .cse24 .cse10 .cse31 .cse32 .cse12 .cse13) (and .cse27 .cse15 .cse16 .cse33 .cse3 .cse28 .cse4 .cse29 .cse34 .cse17 .cse18 .cse19 .cse20 .cse25 .cse30 .cse21 .cse23 .cse22 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21 .cse23 .cse22 .cse24 .cse26) (and .cse27 .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse34 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21 .cse23 .cse22 .cse26) (and .cse27 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse27 .cse15 .cse16 .cse33 .cse3 .cse28 .cse4 .cse29 .cse34 (<= ~c_t~0 .cse35) .cse17 .cse18 .cse19 (<= .cse35 ~c_t~0) .cse20 .cse25 .cse30 .cse23 .cse22 .cse10 .cse31 .cse32 .cse12 .cse13) (and .cse27 .cse15 .cse3 .cse28 .cse4 .cse9 .cse17 .cse18 .cse19 .cse20 .cse30 .cse25 .cse23 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse33 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse30 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse22 .cse24) (and .cse27 .cse0 .cse33 .cse1 .cse2 .cse3 .cse4 .cse6 .cse34 .cse30 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21 .cse22 .cse23 .cse26) (and .cse27 .cse0 .cse1 .cse33 .cse2 .cse3 .cse4 .cse6 .cse34 .cse9 .cse30 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse27 .cse15 .cse16 .cse0 .cse3 .cse28 .cse4 .cse5 .cse29 (= ~data~0 (+ ~t_b~0 2)) .cse34 .cse17 .cse18 .cse19 .cse20 .cse25 .cse30 .cse23 .cse22 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse33 .cse2 .cse3 .cse4 .cse6 .cse8 .cse30 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21 .cse22 .cse23 .cse24 .cse26)))) [2020-12-23 09:36:49,826 INFO L189 CegarLoopUtils]: For program point L85(lines 85 93) no Hoare annotation was computed. [2020-12-23 09:36:49,826 INFO L189 CegarLoopUtils]: For program point L85-1(lines 79 122) no Hoare annotation was computed. [2020-12-23 09:36:49,827 INFO L189 CegarLoopUtils]: For program point L416-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,827 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 09:36:49,827 INFO L189 CegarLoopUtils]: For program point L317(lines 317 324) no Hoare annotation was computed. [2020-12-23 09:36:49,827 INFO L189 CegarLoopUtils]: For program point L86(lines 86 90) no Hoare annotation was computed. [2020-12-23 09:36:49,827 INFO L189 CegarLoopUtils]: For program point L582(lines 582 586) no Hoare annotation was computed. [2020-12-23 09:36:49,827 INFO L189 CegarLoopUtils]: For program point L516-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,827 INFO L189 CegarLoopUtils]: For program point L451-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,827 INFO L189 CegarLoopUtils]: For program point L154(lines 154 162) no Hoare annotation was computed. [2020-12-23 09:36:49,827 INFO L189 CegarLoopUtils]: For program point L154-1(lines 154 162) no Hoare annotation was computed. [2020-12-23 09:36:49,827 INFO L189 CegarLoopUtils]: For program point L617(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,828 INFO L189 CegarLoopUtils]: For program point L155(lines 155 159) no Hoare annotation was computed. [2020-12-23 09:36:49,828 INFO L189 CegarLoopUtils]: For program point L618(lines 618 622) no Hoare annotation was computed. [2020-12-23 09:36:49,828 INFO L189 CegarLoopUtils]: For program point L651-1(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,828 INFO L189 CegarLoopUtils]: For program point L421-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,828 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 09:36:49,828 INFO L189 CegarLoopUtils]: For program point L223(lines 223 231) no Hoare annotation was computed. [2020-12-23 09:36:49,828 INFO L189 CegarLoopUtils]: For program point L190(line 190) no Hoare annotation was computed. [2020-12-23 09:36:49,828 INFO L189 CegarLoopUtils]: For program point L58(lines 58 70) no Hoare annotation was computed. [2020-12-23 09:36:49,828 INFO L189 CegarLoopUtils]: For program point L488(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,829 INFO L189 CegarLoopUtils]: For program point L521-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,829 INFO L185 CegarLoopUtils]: At program point L389(lines 281 394) the Hoare annotation is: (let ((.cse31 (+ ~t_b~0 2))) (let ((.cse30 (= ~data~0 .cse31)) (.cse19 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse25 (= ~e_c~0 2)) (.cse20 (not (= ~wb_st~0 0))) (.cse1 (not (= ~e_wl~0 1))) (.cse26 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse29 (not (= ~r_st~0 0))) (.cse21 (not (= ~c2_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse32 (+ ~t_b~0 1)) (.cse7 (not (= ~e_wl~0 0))) (.cse23 (= ~wb_pc~0 1)) (.cse8 (not (= ~e_e~0 0))) (.cse28 (not (= ~c1_st~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (let ((.cse27 (= ~c_req_up~0 ~r_i~0)) (.cse22 (not (= 2 ~wl_pc~0))) (.cse10 (not (= ~e_c~0 0))) (.cse13 (<= ~c~0 1)) (.cse15 (<= 1 ~c_t~0)) (.cse16 (<= 1 ~c~0)) (.cse17 (<= ~c_t~0 1)) (.cse18 (= ~t_b~0 0)) (.cse24 (= ~d~0 0)) (.cse14 (or (and .cse19 .cse0 .cse25 .cse20 .cse1 .cse26 .cse2 .cse29 .cse30 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse28 .cse9 .cse11 .cse12) (and (= ~data~0 ~t_b~0) .cse19 .cse0 .cse25 .cse20 (= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse1 .cse26 .cse2 .cse29 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse28 .cse9 .cse11 .cse12) (and .cse19 .cse0 .cse25 .cse20 .cse1 .cse26 .cse2 .cse29 .cse21 .cse3 .cse4 .cse5 .cse6 (= ~data~0 .cse32) .cse7 .cse23 .cse8 .cse28 .cse9 .cse11 .cse12)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and (<= ~d~0 1) .cse13 (<= 1 ~d~0) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 (= ~processed~0 0) (= ~r_st~0 ~e_f~0) .cse20 .cse1 (= ~data~0 0) .cse2 .cse18 .cse21 .cse22 .cse23 .cse9 .cse10 .cse11 .cse12 .cse24 .cse25 .cse0 .cse26 .cse3 .cse4 .cse5 .cse6 .cse27 .cse8 .cse28) (and .cse19 .cse0 .cse25 .cse20 .cse1 .cse26 .cse2 .cse29 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse27 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12) (and .cse19 .cse0 .cse25 .cse20 .cse1 .cse26 .cse2 .cse29 .cse30 .cse21 (= ~c_t~0 .cse31) .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse28 .cse9 .cse11 .cse12) (and .cse19 .cse0 .cse1 .cse26 .cse2 .cse29 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24) (and (<= ~c_t~0 .cse32) (<= .cse32 ~c_t~0) .cse14 (<= ~data~0 .cse32) (<= .cse32 ~data~0)))))) [2020-12-23 09:36:49,829 INFO L189 CegarLoopUtils]: For program point L257(lines 257 274) no Hoare annotation was computed. [2020-12-23 09:36:49,830 INFO L185 CegarLoopUtils]: At program point L588(lines 581 598) the Hoare annotation is: (let ((.cse10 (not (= ~e_c~0 0))) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse14 (not (= ~wb_st~0 0))) (.cse1 (not (= ~e_wl~0 1))) (.cse15 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse17 (not (= ~r_st~0 0))) (.cse18 (not (= ~c2_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse7 (not (= ~e_wl~0 0))) (.cse19 (= ~wb_pc~0 1)) (.cse8 (not (= ~e_e~0 0))) (.cse20 (not (= ~c1_st~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (let ((.cse16 (+ ~t_b~0 2))) (and .cse13 .cse0 .cse14 .cse1 .cse15 (= ~c~0 .cse16) .cse2 .cse17 (= ~data~0 .cse16) .cse18 (= ~c_t~0 .cse16) .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12)) (and .cse13 .cse0 .cse15 .cse2 .cse17 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse21 (+ ~t_b~0 1))) (and .cse13 .cse14 .cse1 .cse2 .cse18 (<= ~c_t~0 .cse21) (<= .cse21 ~c_t~0) .cse19 .cse9 .cse10 .cse11 .cse12 .cse0 .cse15 .cse17 (<= .cse21 ~c~0) .cse3 .cse4 .cse5 .cse6 (<= ~c~0 .cse21) .cse7 (= ~data~0 .cse21) .cse20 .cse8)) (and .cse13 .cse0 (= ~e_c~0 2) .cse14 .cse1 .cse15 .cse2 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse20 .cse9 .cse11 .cse12))) [2020-12-23 09:36:49,830 INFO L189 CegarLoopUtils]: For program point L489(lines 489 493) no Hoare annotation was computed. [2020-12-23 09:36:49,830 INFO L189 CegarLoopUtils]: For program point L456-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,830 INFO L189 CegarLoopUtils]: For program point L291(lines 290 388) no Hoare annotation was computed. [2020-12-23 09:36:49,830 INFO L189 CegarLoopUtils]: For program point L258(lines 258 262) no Hoare annotation was computed. [2020-12-23 09:36:49,830 INFO L189 CegarLoopUtils]: For program point L589(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,830 INFO L189 CegarLoopUtils]: For program point L556(lines 556 560) no Hoare annotation was computed. [2020-12-23 09:36:49,830 INFO L189 CegarLoopUtils]: For program point L556-2(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,831 INFO L185 CegarLoopUtils]: At program point L358(lines 290 388) the Hoare annotation is: (let ((.cse35 (= ~c1_st~0 0)) (.cse46 (= 2 ~wl_pc~0)) (.cse33 (= ~c2_st~0 0)) (.cse26 (= ~wb_st~0 0)) (.cse47 (+ ~t_b~0 2)) (.cse45 (+ ~t_b~0 1))) (let ((.cse21 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse41 (<= .cse45 ~c~0)) (.cse42 (<= ~c~0 .cse45)) (.cse36 (<= ~data~0 .cse45)) (.cse37 (<= .cse45 ~data~0)) (.cse34 (= 0 ~wl_pc~0)) (.cse27 (= ~wb_pc~0 0)) (.cse28 (= ~c2_pc~0 0)) (.cse31 (= ~c1_pc~0 0)) (.cse38 (<= ~c_t~0 .cse45)) (.cse39 (<= .cse45 ~c_t~0)) (.cse44 (= ~c~0 .cse47)) (.cse43 (= ~c_t~0 .cse47)) (.cse7 (not (= ~r_st~0 0))) (.cse8 (= ~data~0 .cse47)) (.cse19 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse23 (= ~processed~0 0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse3 (not .cse26)) (.cse25 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse22 (= ~t_b~0 0)) (.cse9 (not .cse33)) (.cse40 (not .cse46)) (.cse15 (= ~wb_pc~0 1)) (.cse18 (= ~wb_i~0 1)) (.cse29 (not (= ~e_c~0 0))) (.cse20 (= ~e_f~0 2)) (.cse30 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse10 (not (= ~e_g~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~r_i~0 1))) (.cse13 (not (= ~e_g~0 0))) (.cse14 (not (= ~e_wl~0 0))) (.cse32 (= ~c_req_up~0 ~r_i~0)) (.cse16 (not (= ~e_e~0 0))) (.cse17 (not .cse35))) (or (and (<= ~d~0 1) (<= ~c~0 1) (<= 1 ~d~0) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (<= 1 ~c_t~0) (<= 1 ~c~0) (<= ~c_t~0 1) .cse22) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse33 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse3 .cse4 .cse6 .cse9 .cse38 .cse39 .cse15 .cse18 .cse19 .cse20 .cse1 .cse2 .cse5 .cse41 .cse10 .cse11 .cse12 .cse13 .cse42 .cse14 .cse17 .cse16 .cse36 .cse37) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse40 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse18 .cse29 .cse19 .cse20) (and (<= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 (<= ~t_b~0 ~data~0) .cse23 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33 .cse18 .cse35 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse43 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse44 .cse6 .cse8 .cse9 .cse43 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse3 .cse4 .cse6 .cse9 (<= ~d~0 .cse45) .cse38 .cse39 .cse15 .cse18 .cse20 .cse1 .cse2 .cse5 .cse7 .cse41 (<= .cse45 ~d~0) .cse10 .cse11 .cse12 .cse46 .cse13 .cse14 .cse42 .cse16 .cse17 .cse36 .cse37) (and .cse1 .cse4 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse34 .cse29 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse36 .cse37 .cse35 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~data~0 .cse45) .cse15 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse44 .cse6 (= ~d~0 .cse47) .cse7 .cse8 .cse9 .cse43 .cse10 .cse11 .cse12 .cse46 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17)))) [2020-12-23 09:36:49,832 INFO L189 CegarLoopUtils]: For program point L226(lines 226 230) no Hoare annotation was computed. [2020-12-23 09:36:49,832 INFO L189 CegarLoopUtils]: For program point L94(lines 94 102) no Hoare annotation was computed. [2020-12-23 09:36:49,832 INFO L189 CegarLoopUtils]: For program point L61(lines 61 69) no Hoare annotation was computed. [2020-12-23 09:36:49,832 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 09:36:49,832 INFO L189 CegarLoopUtils]: For program point L590(lines 590 594) no Hoare annotation was computed. [2020-12-23 09:36:49,832 INFO L185 CegarLoopUtils]: At program point L227(lines 222 249) the Hoare annotation is: (let ((.cse26 (+ ~t_b~0 1)) (.cse24 (= ~c1_st~0 0)) (.cse25 (= ~c2_st~0 0))) (let ((.cse20 (not .cse25)) (.cse13 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse17 (= ~processed~0 0)) (.cse18 (not (= ~wb_st~0 0))) (.cse1 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse19 (not (= ~r_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 1))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_g~0 0))) (.cse15 (= ~wb_pc~0 1)) (.cse7 (not (= ~e_wl~0 0))) (.cse21 (not .cse24)) (.cse8 (not (= ~e_e~0 0))) (.cse9 (= ~wb_i~0 1)) (.cse22 (<= ~data~0 .cse26)) (.cse23 (<= .cse26 ~data~0)) (.cse10 (not (= ~e_c~0 0))) (.cse11 (not (= 0 ~wl_st~0))) (.cse12 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse14 .cse2 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse16 .cse17 .cse18 .cse1 .cse14 .cse2 .cse19 (= ~data~0 (+ ~t_b~0 2)) .cse20 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse16 .cse17 .cse18 .cse1 .cse14 .cse2 .cse19 .cse20 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse22 .cse23 .cse24 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse16 .cse17 .cse18 .cse1 .cse14 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse21 .cse8 .cse25 .cse9 .cse22 .cse23 .cse10 .cse11 .cse12)))) [2020-12-23 09:36:49,833 INFO L189 CegarLoopUtils]: For program point L95(lines 95 99) no Hoare annotation was computed. [2020-12-23 09:36:49,833 INFO L185 CegarLoopUtils]: At program point L62(lines 57 127) the Hoare annotation is: (let ((.cse9 (= ~c1_i~0 1)) (.cse10 (= ~e_c~0 2)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (not (= ~wb_st~0 0))) (.cse2 (not (= ~e_wl~0 1))) (.cse11 (= ~c1_pc~0 1)) (.cse3 (= ~c2_i~0 1)) (.cse12 (not (= ~r_st~0 0))) (.cse13 (not (= ~e_g~0 1))) (.cse14 (not (= ~e_e~0 1))) (.cse15 (not (= ~r_i~0 1))) (.cse16 (= 2 ~wl_pc~0)) (.cse17 (not (= ~e_g~0 0))) (.cse18 (not (= ~e_wl~0 0))) (.cse5 (= ~wb_pc~0 1)) (.cse19 (not (= ~e_e~0 0))) (.cse6 (= ~wb_i~0 1)) (.cse7 (not (= 0 ~wl_st~0))) (.cse8 (= ~e_f~0 2))) (or (let ((.cse4 (+ ~t_b~0 1))) (and .cse0 .cse1 .cse2 .cse3 (<= ~d~0 .cse4) (<= ~c_t~0 .cse4) (<= .cse4 ~c_t~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse4 ~c~0) (<= .cse4 ~d~0) .cse13 .cse14 .cse15 .cse16 .cse17 (<= ~c~0 .cse4) .cse18 .cse19 (<= ~data~0 .cse4) (<= .cse4 ~data~0))) (let ((.cse20 (+ ~t_b~0 2))) (and .cse9 .cse10 .cse0 .cse1 .cse2 .cse11 (= ~c~0 .cse20) .cse3 (= ~d~0 .cse20) .cse12 (= ~data~0 .cse20) (= ~c_t~0 .cse20) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse5 .cse19 .cse6 .cse7 .cse8)))) [2020-12-23 09:36:49,833 INFO L189 CegarLoopUtils]: For program point L426-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,833 INFO L189 CegarLoopUtils]: For program point L526-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,834 INFO L185 CegarLoopUtils]: At program point L328(lines 290 388) the Hoare annotation is: (let ((.cse35 (= ~c1_st~0 0)) (.cse46 (= 2 ~wl_pc~0)) (.cse33 (= ~c2_st~0 0)) (.cse26 (= ~wb_st~0 0)) (.cse47 (+ ~t_b~0 2)) (.cse45 (+ ~t_b~0 1))) (let ((.cse21 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse41 (<= .cse45 ~c~0)) (.cse42 (<= ~c~0 .cse45)) (.cse36 (<= ~data~0 .cse45)) (.cse37 (<= .cse45 ~data~0)) (.cse34 (= 0 ~wl_pc~0)) (.cse27 (= ~wb_pc~0 0)) (.cse28 (= ~c2_pc~0 0)) (.cse31 (= ~c1_pc~0 0)) (.cse38 (<= ~c_t~0 .cse45)) (.cse39 (<= .cse45 ~c_t~0)) (.cse43 (= ~c~0 .cse47)) (.cse44 (= ~c_t~0 .cse47)) (.cse7 (not (= ~r_st~0 0))) (.cse8 (= ~data~0 .cse47)) (.cse19 (not (= 0 ~wl_st~0))) (.cse0 (= ~c2_pc~0 1)) (.cse23 (= ~processed~0 0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse3 (not .cse26)) (.cse25 (= ~data~0 0)) (.cse4 (not (= ~e_wl~0 1))) (.cse6 (= ~c2_i~0 1)) (.cse22 (= ~t_b~0 0)) (.cse9 (not .cse33)) (.cse40 (not .cse46)) (.cse15 (= ~wb_pc~0 1)) (.cse18 (= ~wb_i~0 1)) (.cse29 (not (= ~e_c~0 0))) (.cse20 (= ~e_f~0 2)) (.cse30 (= ~d~0 0)) (.cse1 (= ~c1_i~0 1)) (.cse2 (= ~e_c~0 2)) (.cse5 (= ~c1_pc~0 1)) (.cse10 (not (= ~e_g~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~r_i~0 1))) (.cse13 (not (= ~e_g~0 0))) (.cse14 (not (= ~e_wl~0 0))) (.cse32 (= ~c_req_up~0 ~r_i~0)) (.cse16 (not (= ~e_e~0 0))) (.cse17 (not .cse35))) (or (and (<= ~d~0 1) (<= ~c~0 1) (<= 1 ~d~0) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (<= 1 ~c_t~0) (<= 1 ~c~0) (<= ~c_t~0 1) .cse22) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse33 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse36 .cse37 .cse19 .cse20) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse3 .cse4 .cse6 .cse9 .cse38 .cse39 .cse15 .cse18 .cse19 .cse20 .cse1 .cse2 .cse5 .cse41 .cse10 .cse11 .cse12 .cse13 .cse42 .cse14 .cse17 .cse16 .cse36 .cse37) (and .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse28 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse33 .cse34) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse40 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse18 .cse29 .cse19 .cse20) (and (<= ~data~0 ~t_b~0) .cse0 .cse1 .cse2 (<= ~t_b~0 ~data~0) .cse23 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33 .cse18 .cse35 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse35) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse17 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse3 .cse4 .cse6 .cse9 (<= ~d~0 .cse45) .cse38 .cse39 .cse15 .cse18 .cse20 .cse1 .cse2 .cse5 .cse7 .cse41 (<= .cse45 ~d~0) .cse10 .cse11 .cse12 .cse46 .cse13 .cse14 .cse42 .cse16 .cse17 .cse36 .cse37) (and .cse1 .cse4 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse34 .cse29 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse28 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse33 .cse34 .cse35) (and .cse0 .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse9 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse36 .cse37 .cse35 .cse19 .cse20) (and .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse22 .cse28 .cse40 .cse15 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse32 .cse16 .cse17 .cse33) (and .cse0 .cse23 .cse24 .cse25 .cse4 .cse6 .cse26 .cse22 .cse27 .cse9 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse32 .cse16 .cse34 .cse35) (and .cse23 .cse24 .cse4 .cse25 .cse6 .cse26 .cse22 .cse27 .cse28 .cse40 .cse18 .cse29 .cse19 .cse20 .cse30 .cse2 .cse1 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse16 .cse33 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse38 .cse39 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~data~0 .cse45) .cse15 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse6 (= ~d~0 .cse47) .cse7 .cse8 .cse9 .cse44 .cse10 .cse11 .cse12 .cse46 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse23 .cse24 .cse3 .cse25 .cse4 .cse6 .cse22 .cse9 .cse40 .cse15 .cse18 .cse29 .cse20 .cse30 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse16 .cse17)))) [2020-12-23 09:36:49,834 INFO L189 CegarLoopUtils]: For program point L295(lines 295 311) no Hoare annotation was computed. [2020-12-23 09:36:49,835 INFO L185 CegarLoopUtils]: At program point L196-1(lines 177 217) the Hoare annotation is: (let ((.cse32 (= ~c1_st~0 0)) (.cse27 (= ~wb_st~0 0)) (.cse35 (+ ~t_b~0 1))) (let ((.cse33 (<= ~data~0 .cse35)) (.cse34 (<= .cse35 ~data~0)) (.cse8 (not (= 2 ~wl_pc~0))) (.cse1 (not .cse27)) (.cse29 (= ~c2_pc~0 1)) (.cse17 (= ~c1_pc~0 1)) (.cse30 (not (= ~r_st~0 0))) (.cse9 (= ~wb_pc~0 1)) (.cse23 (not .cse32)) (.cse12 (not (= 0 ~wl_st~0))) (.cse0 (= ~processed~0 0)) (.cse2 (= ~r_st~0 ~e_f~0)) (.cse4 (not (= ~e_wl~0 1))) (.cse3 (= ~data~0 0)) (.cse5 (= ~c2_i~0 1)) (.cse6 (= ~t_b~0 0)) (.cse28 (= ~wb_pc~0 0)) (.cse7 (not (= ~c2_st~0 0))) (.cse10 (= ~wb_i~0 1)) (.cse11 (not (= ~e_c~0 0))) (.cse13 (= ~e_f~0 2)) (.cse14 (= ~d~0 0)) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse18 (not (= ~e_g~0 1))) (.cse19 (not (= ~e_e~0 1))) (.cse20 (not (= ~r_i~0 1))) (.cse31 (= ~c1_pc~0 0)) (.cse21 (not (= ~e_g~0 0))) (.cse25 (not (= ~e_wl~0 0))) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse24 (not (= ~e_e~0 0))) (.cse26 (= 0 ~wl_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse15 .cse4 .cse5 .cse18 .cse19 .cse20 .cse21 .cse25 .cse24 .cse10 .cse26 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse4 .cse3 .cse5 .cse27 .cse6 .cse28 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse24 .cse23 .cse26) (and .cse29 .cse15 .cse16 .cse1 .cse4 .cse17 .cse5 .cse30 .cse7 .cse18 .cse19 .cse20 .cse21 .cse25 .cse9 .cse22 .cse24 .cse23 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse4 .cse3 .cse5 .cse27 .cse6 .cse28 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse24 .cse32) (and .cse29 .cse15 .cse16 .cse0 .cse4 .cse17 .cse5 .cse27 .cse30 .cse7 .cse18 .cse19 .cse20 .cse21 .cse25 .cse9 .cse24 .cse10 .cse33 .cse34 .cse32 .cse12 .cse13) (and .cse29 .cse15 .cse16 .cse1 .cse4 .cse17 .cse5 .cse30 .cse7 (<= ~c_t~0 .cse35) .cse18 .cse19 .cse20 (<= .cse35 ~c_t~0) .cse21 .cse25 .cse9 .cse24 .cse23 .cse10 .cse33 .cse34 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse24 .cse32) (and .cse0 .cse2 .cse4 .cse3 .cse5 .cse27 .cse6 .cse28 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse23) (and .cse29 .cse15 .cse4 .cse17 .cse5 .cse8 .cse18 .cse19 .cse20 .cse21 .cse9 .cse25 .cse24 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse23 .cse24 .cse26) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse25 .cse22 .cse24 .cse26 .cse32) (and .cse29 .cse15 .cse16 .cse0 .cse4 .cse17 .cse5 .cse27 .cse30 (= ~data~0 (+ ~t_b~0 2)) .cse7 .cse18 .cse19 .cse20 .cse21 .cse25 .cse9 .cse24 .cse23 .cse10 .cse12 .cse13) (and .cse0 .cse2 .cse4 .cse3 .cse5 .cse27 .cse6 .cse28 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse25 .cse22 .cse24 .cse26 .cse32)))) [2020-12-23 09:36:49,835 INFO L189 CegarLoopUtils]: For program point L64(lines 64 68) no Hoare annotation was computed. [2020-12-23 09:36:49,835 INFO L189 CegarLoopUtils]: For program point L659(lines 659 675) no Hoare annotation was computed. [2020-12-23 09:36:49,835 INFO L189 CegarLoopUtils]: For program point L626-1(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,836 INFO L189 CegarLoopUtils]: For program point L362(lines 362 369) no Hoare annotation was computed. [2020-12-23 09:36:49,836 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 09:36:49,836 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-12-23 09:36:49,836 INFO L189 CegarLoopUtils]: For program point L561-1(lines 537 677) no Hoare annotation was computed. [2020-12-23 09:36:49,836 INFO L189 CegarLoopUtils]: For program point L462(lines 462 466) no Hoare annotation was computed. [2020-12-23 09:36:49,836 INFO L185 CegarLoopUtils]: At program point L264(lines 257 274) the Hoare annotation is: (let ((.cse14 (not (= ~wb_st~0 0))) (.cse18 (not (= ~c2_st~0 0))) (.cse13 (= ~e_c~0 2)) (.cse20 (not (= ~c1_st~0 0))) (.cse12 (= ~c2_pc~0 1)) (.cse0 (= ~c1_i~0 1)) (.cse1 (not (= ~e_wl~0 1))) (.cse15 (= ~c1_pc~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse17 (not (= ~r_st~0 0))) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~r_i~0 1))) (.cse5 (not (= ~e_g~0 0))) (.cse19 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_wl~0 0))) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~wb_i~0 1)) (.cse9 (not (= ~e_c~0 0))) (.cse10 (not (= 0 ~wl_st~0))) (.cse11 (= ~e_f~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~wl_pc~0) .cse9 .cse10 .cse11) (let ((.cse16 (+ ~t_b~0 2))) (and .cse12 .cse0 .cse13 .cse14 .cse1 .cse15 (= ~c~0 .cse16) .cse2 (= ~d~0 .cse16) .cse17 (= ~data~0 .cse16) .cse18 (= ~c_t~0 .cse16) .cse3 .cse4 .cse5 .cse19 .cse6 .cse20 .cse7 .cse8 .cse10 .cse11)) (let ((.cse21 (+ ~t_b~0 1))) (and .cse12 .cse14 .cse1 .cse2 .cse18 (<= ~d~0 .cse21) (<= ~c_t~0 .cse21) (<= .cse21 ~c_t~0) .cse19 .cse8 .cse10 .cse11 .cse0 .cse13 .cse15 .cse17 (<= .cse21 ~c~0) (<= .cse21 ~d~0) .cse3 .cse4 .cse5 (<= ~c~0 .cse21) .cse6 .cse20 .cse7 (<= ~data~0 .cse21) (<= .cse21 ~data~0))) (and .cse12 .cse0 .cse1 .cse15 .cse2 .cse17 (not (= 2 ~wl_pc~0)) .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2020-12-23 09:36:49,836 INFO L189 CegarLoopUtils]: For program point L298(lines 298 310) no Hoare annotation was computed. [2020-12-23 09:36:49,837 INFO L189 CegarLoopUtils]: For program point L265(lines 257 274) no Hoare annotation was computed. [2020-12-23 09:36:49,837 INFO L189 CegarLoopUtils]: For program point L199(lines 199 207) no Hoare annotation was computed. [2020-12-23 09:36:49,837 INFO L189 CegarLoopUtils]: For program point L199-1(lines 199 207) no Hoare annotation was computed. [2020-12-23 09:36:49,837 INFO L189 CegarLoopUtils]: For program point L133(lines 133 141) no Hoare annotation was computed. [2020-12-23 09:36:49,837 INFO L189 CegarLoopUtils]: For program point L662(lines 662 674) no Hoare annotation was computed. [2020-12-23 09:36:49,837 INFO L189 CegarLoopUtils]: For program point L497(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,837 INFO L189 CegarLoopUtils]: For program point L431-1(lines 398 682) no Hoare annotation was computed. [2020-12-23 09:36:49,837 INFO L189 CegarLoopUtils]: For program point L332(lines 332 339) no Hoare annotation was computed. [2020-12-23 09:36:49,837 INFO L189 CegarLoopUtils]: For program point L266(lines 266 270) no Hoare annotation was computed. [2020-12-23 09:36:49,837 INFO L189 CegarLoopUtils]: For program point L200(lines 200 204) no Hoare annotation was computed. [2020-12-23 09:36:49,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:36:49 BoogieIcfgContainer [2020-12-23 09:36:49,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 09:36:49,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 09:36:49,998 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 09:36:49,998 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 09:36:49,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:35:11" (3/4) ... [2020-12-23 09:36:50,002 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 09:36:50,018 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-23 09:36:50,019 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-23 09:36:50,020 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 09:36:50,020 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 09:36:50,175 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/toy.cil.c-witness.graphml [2020-12-23 09:36:50,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 09:36:50,177 INFO L168 Benchmark]: Toolchain (without parser) took 99902.36 ms. Allocated memory was 154.1 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 128.6 MB in the beginning and 781.6 MB in the end (delta: -653.0 MB). Peak memory consumption was 911.7 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:50,177 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 154.1 MB. Free memory is still 127.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:36:50,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.69 ms. Allocated memory is still 154.1 MB. Free memory was 128.3 MB in the beginning and 114.0 MB in the end (delta: 14.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:50,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.55 ms. Allocated memory is still 154.1 MB. Free memory was 114.0 MB in the beginning and 111.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:50,178 INFO L168 Benchmark]: Boogie Preprocessor took 42.84 ms. Allocated memory is still 154.1 MB. Free memory was 111.6 MB in the beginning and 109.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:50,178 INFO L168 Benchmark]: RCFGBuilder took 962.63 ms. Allocated memory is still 154.1 MB. Free memory was 109.7 MB in the beginning and 104.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:50,179 INFO L168 Benchmark]: TraceAbstraction took 98221.51 ms. Allocated memory was 154.1 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 104.1 MB in the beginning and 806.0 MB in the end (delta: -701.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. [2020-12-23 09:36:50,179 INFO L168 Benchmark]: Witness Printer took 177.68 ms. Allocated memory is still 1.7 GB. Free memory was 806.0 MB in the beginning and 781.6 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:50,182 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 154.1 MB. Free memory is still 127.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 421.69 ms. Allocated memory is still 154.1 MB. Free memory was 128.3 MB in the beginning and 114.0 MB in the end (delta: 14.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 67.55 ms. Allocated memory is still 154.1 MB. Free memory was 114.0 MB in the beginning and 111.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.84 ms. Allocated memory is still 154.1 MB. Free memory was 111.6 MB in the beginning and 109.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 962.63 ms. Allocated memory is still 154.1 MB. Free memory was 109.7 MB in the beginning and 104.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 98221.51 ms. Allocated memory was 154.1 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 104.1 MB in the beginning and 806.0 MB in the end (delta: -701.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. * Witness Printer took 177.68 ms. Allocated memory is still 1.7 GB. Free memory was 806.0 MB in the beginning and 781.6 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((d <= 1 && c <= 1) && 1 <= d) && (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && c <= t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c1_i == 1 && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((c1_i == 1 && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((data == t_b && c1_i == 1) && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) && 2 == wl_pc) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((d <= 1 && c <= 1) && 1 <= d) && (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && c <= t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: ((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && data == t_b + 1) && !(c1_st == 0)) && !(e_e == 0))) || (((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data) || ((((((((((((((((((((((c1_i == 1 && e_c == 2) && c2_pc == 1) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((d <= 1 && c <= 1) && 1 <= d) && ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && c <= t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || ((((((c <= 1 && ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) && d == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((e_c == 2 && c1_i == 1) && c2_i == 1) && wb_st == 0) && e_g == e_f) && !(r_i == 1)) && c_req_up == r_i) && c2_st == 0) && wb_i == 1) && 0 == wl_pc) && e_e == e_c) && c1_st == 0) && !(0 == wl_st)) && e_f == 2) && e_wl == e_c) || (((((((((((((((((((((e_c == 2 && c1_i == 1) && processed == 0) && r_st == e_f) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && e_g == e_f) && wb_pc == 0) && c2_pc == 0) && !(r_i == 1)) && c1_pc == 0) && c_req_up == r_i) && c2_st == 0) && wb_i == 1) && 0 == wl_pc) && e_e == e_c) && c1_st == 0) && e_f == 2) && d == 0) && e_wl == e_c) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((d <= 1 && c <= 1) && 1 <= d) && (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && c <= t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0))) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && t_b + 1 <= c_t) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && !(wb_st == 0)) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && 0 == wl_pc)) || ((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0))) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && data == t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && t == data) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((d <= 1 && c <= 1) && 1 <= d) && (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || ((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && t_b + 1 <= c) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c <= t_b + 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0) && 0 == wl_pc)) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((data <= t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && t_b <= data) && processed == 0) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((((c2_pc == 1 && !(wb_st == 0)) && !(e_wl == 1)) && c2_i == 1) && !(c2_st == 0)) && d <= t_b + 1) && c_t <= t_b + 1) && t_b + 1 <= c_t) && wb_pc == 1) && wb_i == 1) && e_f == 2) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(r_st == 0)) && t_b + 1 <= c) && t_b + 1 <= d) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && !(e_wl == 0)) && c <= t_b + 1) && !(e_e == 0)) && !(c1_st == 0)) && data <= t_b + 1) && t_b + 1 <= data)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && c2_pc == 0) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && c2_st == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && c2_pc == 0) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c2_st == 0) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && t_b + 1 <= c_t) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && data == t_b + 1) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c == t_b + 2) && c2_i == 1) && d == t_b + 2) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && 2 == wl_pc) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((processed == 0 && !(wb_st == 0)) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) || (((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && 0 == wl_pc)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && c_t <= t_b + 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && t_b + 1 <= c_t) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && !(wb_st == 0)) && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && c1_st == 0)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && !(wb_st == 0)) && r_st == e_f) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(c1_st == 0)) && !(e_e == 0)) && 0 == wl_pc)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(wb_st == 0)) && data == 0) && !(e_wl == 1)) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && wb_st == 0) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((((processed == 0 && r_st == e_f) && !(e_wl == 1)) && data == 0) && c2_i == 1) && wb_st == 0) && t_b == 0) && wb_pc == 0) && !(c2_st == 0)) && wb_i == 1) && !(e_c == 0)) && e_f == 2) && d == 0) && c1_i == 1) && e_c == 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && c1_pc == 0) && !(e_g == 0)) && !(e_wl == 0)) && c_req_up == r_i) && !(e_e == 0)) && 0 == wl_pc) && c1_st == 0) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || ((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && c1_st == 0) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && processed == 0) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(c1_st == 0)) && !(e_e == 0)) && c2_st == 0) && wb_i == 1) && data <= t_b + 1) && t_b + 1 <= data) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((((((((((((c1_i == 1 && !(e_wl == 1)) && c2_i == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && 0 == wl_pc) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) || (((((((d <= 1 && c <= 1) && 1 <= d) && ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0)) || (((((((((((((((((((((((((c2_pc == 1 && processed == 0) && r_st == e_f) && !(wb_st == 0)) && !(e_wl == 1)) && data == 0) && c2_i == 1) && t_b == 0) && !(c2_st == 0)) && !(2 == wl_pc)) && wb_pc == 1) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2) && d == 0) && e_c == 2) && c1_i == 1) && c1_pc == 1) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0))) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && c_req_up == r_i) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && c_t == t_b + 2) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || (((((((((((((((((c2_pc == 1 && c1_i == 1) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(2 == wl_pc)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && wb_pc == 1) && !(e_wl == 0)) && !(e_e == 0)) && wb_i == 1) && !(e_c == 0)) && !(0 == wl_st)) && e_f == 2)) || ((((((c <= 1 && ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && 1 <= c_t) && 1 <= c) && c_t <= 1) && t_b == 0) && d == 0)) || ((((c_t <= t_b + 1 && t_b + 1 <= c_t) && ((((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && data == t_b + 2) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2) || (((((((((((((((((((((data == t_b && c2_pc == 1) && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && t == data) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2)) || ((((((((((((((((((((c2_pc == 1 && c1_i == 1) && e_c == 2) && !(wb_st == 0)) && !(e_wl == 1)) && c1_pc == 1) && c2_i == 1) && !(r_st == 0)) && !(c2_st == 0)) && !(e_g == 1)) && !(e_e == 1)) && !(r_i == 1)) && !(e_g == 0)) && data == t_b + 1) && !(e_wl == 0)) && wb_pc == 1) && !(e_e == 0)) && !(c1_st == 0)) && wb_i == 1) && !(0 == wl_st)) && e_f == 2))) && data <= t_b + 1) && t_b + 1 <= data) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.5s, OverallIterations: 37, TraceHistogramMax: 10, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 70.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7966 SDtfs, 11093 SDslu, 12861 SDs, 0 SdLazy, 1440 SolverSat, 306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 906 GetRequests, 764 SyntacticMatches, 5 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5290occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 7464 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 867 NumberOfFragments, 21587 HoareAnnotationTreeSize, 20 FomulaSimplifications, 27280405 FormulaSimplificationTreeSizeReduction, 8.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 2895198 FormulaSimplificationTreeSizeReductionInter, 62.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 4397 NumberOfCodeBlocks, 4397 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4357 ConstructedInterpolants, 0 QuantifiedInterpolants, 2127135 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1821 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 2353/2774 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...