/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/toy2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:35:48,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:35:48,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:35:48,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:35:48,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:35:48,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:35:48,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:35:48,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:35:48,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:35:48,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:35:48,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:35:48,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:35:48,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:35:48,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:35:48,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:35:48,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:35:48,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:35:48,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:35:48,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:35:48,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:35:48,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:35:48,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:35:48,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:35:48,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:35:48,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:35:48,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:35:48,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:35:48,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:35:48,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:35:48,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:35:48,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:35:48,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:35:48,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:35:48,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:35:48,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:35:48,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:35:48,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:35:48,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:35:48,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:35:48,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:35:48,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:35:48,535 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:48,575 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:35:48,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:35:48,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:35:48,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:35:48,581 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:35:48,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:35:48,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:35:48,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:35:48,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:35:48,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:35:48,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:35:48,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:35:48,583 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:35:48,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:35:48,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:35:48,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:35:48,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:35:48,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:35:48,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:35:48,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:35:48,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:35:48,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:35:48,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:35:48,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:35:48,588 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:35:48,589 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:49,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:35:49,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:35:49,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:35:49,056 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:35:49,057 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:35:49,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2020-12-23 09:35:49,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7710a1b9b/87c7983197c64a07b545bcfabf7cb382/FLAG41ca3b11c [2020-12-23 09:35:49,846 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:35:49,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2020-12-23 09:35:49,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7710a1b9b/87c7983197c64a07b545bcfabf7cb382/FLAG41ca3b11c [2020-12-23 09:35:50,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7710a1b9b/87c7983197c64a07b545bcfabf7cb382 [2020-12-23 09:35:50,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:35:50,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:35:50,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:35:50,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:35:50,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:35:50,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9a836e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50, skipping insertion in model container [2020-12-23 09:35:50,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:35:50" (1/1) ... [2020-12-23 09:35:50,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:35:50,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:35:50,365 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/toy2.cil.c[393,406] 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:50,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:35:50,461 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:35:50,475 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/toy2.cil.c[393,406] 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:50,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:35:50,577 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:35:50,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50 WrapperNode [2020-12-23 09:35:50,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:35:50,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:35:50,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:35:50,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:35:50,589 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:50" (1/1) ... [2020-12-23 09:35:50,602 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:50" (1/1) ... [2020-12-23 09:35:50,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:35:50,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:35:50,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:35:50,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:35:50,651 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:50" (1/1) ... [2020-12-23 09:35:50,652 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:50" (1/1) ... [2020-12-23 09:35:50,655 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:50" (1/1) ... [2020-12-23 09:35:50,656 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:50" (1/1) ... [2020-12-23 09:35:50,664 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:50" (1/1) ... [2020-12-23 09:35:50,683 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:50" (1/1) ... [2020-12-23 09:35:50,689 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:50" (1/1) ... [2020-12-23 09:35:50,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:35:50,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:35:50,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:35:50,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:35:50,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (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:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:35:50,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:35:51,658 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:35:51,658 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2020-12-23 09:35:51,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:35:51 BoogieIcfgContainer [2020-12-23 09:35:51,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:35:51,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:35:51,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:35:51,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:35:51,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:35:50" (1/3) ... [2020-12-23 09:35:51,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130b791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:35:51, skipping insertion in model container [2020-12-23 09:35:51,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:35:50" (2/3) ... [2020-12-23 09:35:51,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130b791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:35:51, skipping insertion in model container [2020-12-23 09:35:51,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:35:51" (3/3) ... [2020-12-23 09:35:51,682 INFO L111 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2020-12-23 09:35:51,692 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:35:51,698 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:35:51,722 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:35:51,778 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:35:51,778 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:35:51,778 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:35:51,779 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:35:51,781 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:35:51,781 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:35:51,781 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:35:51,781 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:35:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2020-12-23 09:35:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:51,824 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:51,825 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] [2020-12-23 09:35:51,825 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:51,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1633671955, now seen corresponding path program 1 times [2020-12-23 09:35:51,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:51,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461460428] [2020-12-23 09:35:51,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:52,143 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:52,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461460428] [2020-12-23 09:35:52,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:52,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:52,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272609326] [2020-12-23 09:35:52,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:52,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:52,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:52,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:52,169 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2020-12-23 09:35:52,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:52,225 INFO L93 Difference]: Finished difference Result 242 states and 449 transitions. [2020-12-23 09:35:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:52,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-23 09:35:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:52,240 INFO L225 Difference]: With dead ends: 242 [2020-12-23 09:35:52,240 INFO L226 Difference]: Without dead ends: 121 [2020-12-23 09:35:52,244 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:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-23 09:35:52,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-12-23 09:35:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-23 09:35:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2020-12-23 09:35:52,323 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 35 [2020-12-23 09:35:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:52,323 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions. [2020-12-23 09:35:52,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2020-12-23 09:35:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:52,329 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:52,329 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] [2020-12-23 09:35:52,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:35:52,330 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:52,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:52,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1611039701, now seen corresponding path program 1 times [2020-12-23 09:35:52,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:52,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110941702] [2020-12-23 09:35:52,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:52,442 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:52,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110941702] [2020-12-23 09:35:52,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:52,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:52,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422435268] [2020-12-23 09:35:52,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:52,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:52,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:52,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:52,447 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand 4 states. [2020-12-23 09:35:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:52,522 INFO L93 Difference]: Finished difference Result 325 states and 571 transitions. [2020-12-23 09:35:52,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:52,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-23 09:35:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:52,526 INFO L225 Difference]: With dead ends: 325 [2020-12-23 09:35:52,526 INFO L226 Difference]: Without dead ends: 207 [2020-12-23 09:35:52,528 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:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-12-23 09:35:52,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2020-12-23 09:35:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-23 09:35:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 357 transitions. [2020-12-23 09:35:52,560 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 357 transitions. Word has length 35 [2020-12-23 09:35:52,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:52,560 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 357 transitions. [2020-12-23 09:35:52,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 357 transitions. [2020-12-23 09:35:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:52,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:52,563 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] [2020-12-23 09:35:52,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:35:52,564 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:52,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1101566611, now seen corresponding path program 1 times [2020-12-23 09:35:52,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:52,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506933906] [2020-12-23 09:35:52,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:52,685 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:52,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506933906] [2020-12-23 09:35:52,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:52,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:52,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193176026] [2020-12-23 09:35:52,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:52,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:52,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:52,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:52,688 INFO L87 Difference]: Start difference. First operand 204 states and 357 transitions. Second operand 3 states. [2020-12-23 09:35:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:52,793 INFO L93 Difference]: Finished difference Result 399 states and 701 transitions. [2020-12-23 09:35:52,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:52,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-23 09:35:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:52,801 INFO L225 Difference]: With dead ends: 399 [2020-12-23 09:35:52,802 INFO L226 Difference]: Without dead ends: 204 [2020-12-23 09:35:52,808 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:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-12-23 09:35:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2020-12-23 09:35:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-23 09:35:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 345 transitions. [2020-12-23 09:35:52,858 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 345 transitions. Word has length 35 [2020-12-23 09:35:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:52,858 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 345 transitions. [2020-12-23 09:35:52,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 345 transitions. [2020-12-23 09:35:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:52,860 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:52,861 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] [2020-12-23 09:35:52,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:35:52,861 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:52,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:52,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1744930967, now seen corresponding path program 1 times [2020-12-23 09:35:52,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:52,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323973017] [2020-12-23 09:35:52,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:52,992 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:52,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323973017] [2020-12-23 09:35:52,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:52,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:52,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995691337] [2020-12-23 09:35:52,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:52,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:52,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:52,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:52,997 INFO L87 Difference]: Start difference. First operand 204 states and 345 transitions. Second operand 4 states. [2020-12-23 09:35:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:53,154 INFO L93 Difference]: Finished difference Result 553 states and 938 transitions. [2020-12-23 09:35:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:53,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-23 09:35:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:53,157 INFO L225 Difference]: With dead ends: 553 [2020-12-23 09:35:53,158 INFO L226 Difference]: Without dead ends: 359 [2020-12-23 09:35:53,159 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:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-12-23 09:35:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 204. [2020-12-23 09:35:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-23 09:35:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 342 transitions. [2020-12-23 09:35:53,178 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 342 transitions. Word has length 35 [2020-12-23 09:35:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:53,178 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 342 transitions. [2020-12-23 09:35:53,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 342 transitions. [2020-12-23 09:35:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:53,180 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:53,180 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] [2020-12-23 09:35:53,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:35:53,180 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:53,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1806970581, now seen corresponding path program 1 times [2020-12-23 09:35:53,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:53,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678237947] [2020-12-23 09:35:53,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:53,234 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:53,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678237947] [2020-12-23 09:35:53,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:53,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:53,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464568178] [2020-12-23 09:35:53,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:53,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:53,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:53,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:53,237 INFO L87 Difference]: Start difference. First operand 204 states and 342 transitions. Second operand 4 states. [2020-12-23 09:35:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:53,363 INFO L93 Difference]: Finished difference Result 556 states and 934 transitions. [2020-12-23 09:35:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:53,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-23 09:35:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:53,367 INFO L225 Difference]: With dead ends: 556 [2020-12-23 09:35:53,367 INFO L226 Difference]: Without dead ends: 363 [2020-12-23 09:35:53,368 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:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-12-23 09:35:53,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 204. [2020-12-23 09:35:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-23 09:35:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 339 transitions. [2020-12-23 09:35:53,384 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 339 transitions. Word has length 35 [2020-12-23 09:35:53,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:53,384 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 339 transitions. [2020-12-23 09:35:53,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:53,384 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 339 transitions. [2020-12-23 09:35:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:53,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:53,386 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] [2020-12-23 09:35:53,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:35:53,386 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:53,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:53,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1947519191, now seen corresponding path program 1 times [2020-12-23 09:35:53,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:53,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972109672] [2020-12-23 09:35:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:53,424 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:53,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972109672] [2020-12-23 09:35:53,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:53,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:53,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936388235] [2020-12-23 09:35:53,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:53,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:53,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:53,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:53,428 INFO L87 Difference]: Start difference. First operand 204 states and 339 transitions. Second operand 4 states. [2020-12-23 09:35:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:53,534 INFO L93 Difference]: Finished difference Result 568 states and 945 transitions. [2020-12-23 09:35:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:53,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-23 09:35:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:53,537 INFO L225 Difference]: With dead ends: 568 [2020-12-23 09:35:53,538 INFO L226 Difference]: Without dead ends: 376 [2020-12-23 09:35:53,538 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:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-12-23 09:35:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 210. [2020-12-23 09:35:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-23 09:35:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 343 transitions. [2020-12-23 09:35:53,552 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 343 transitions. Word has length 35 [2020-12-23 09:35:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:53,553 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 343 transitions. [2020-12-23 09:35:53,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 343 transitions. [2020-12-23 09:35:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:53,554 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:53,555 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] [2020-12-23 09:35:53,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:35:53,555 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:53,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1813505685, now seen corresponding path program 1 times [2020-12-23 09:35:53,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:53,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630095740] [2020-12-23 09:35:53,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:53,590 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:53,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630095740] [2020-12-23 09:35:53,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:53,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:53,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651369257] [2020-12-23 09:35:53,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:53,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:53,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:53,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:53,593 INFO L87 Difference]: Start difference. First operand 210 states and 343 transitions. Second operand 4 states. [2020-12-23 09:35:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:53,728 INFO L93 Difference]: Finished difference Result 713 states and 1165 transitions. [2020-12-23 09:35:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:53,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-23 09:35:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:53,734 INFO L225 Difference]: With dead ends: 713 [2020-12-23 09:35:53,734 INFO L226 Difference]: Without dead ends: 516 [2020-12-23 09:35:53,736 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:53,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-12-23 09:35:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 341. [2020-12-23 09:35:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-12-23 09:35:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 554 transitions. [2020-12-23 09:35:53,765 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 554 transitions. Word has length 35 [2020-12-23 09:35:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:53,765 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 554 transitions. [2020-12-23 09:35:53,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 554 transitions. [2020-12-23 09:35:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:53,770 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:53,771 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] [2020-12-23 09:35:53,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:35:53,771 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:53,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:53,772 INFO L82 PathProgramCache]: Analyzing trace with hash 8067351, now seen corresponding path program 1 times [2020-12-23 09:35:53,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:53,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206924953] [2020-12-23 09:35:53,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:53,840 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:53,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206924953] [2020-12-23 09:35:53,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:53,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:53,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650509827] [2020-12-23 09:35:53,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:53,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:53,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:53,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:53,843 INFO L87 Difference]: Start difference. First operand 341 states and 554 transitions. Second operand 3 states. [2020-12-23 09:35:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:53,900 INFO L93 Difference]: Finished difference Result 812 states and 1325 transitions. [2020-12-23 09:35:53,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:53,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-23 09:35:53,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:53,905 INFO L225 Difference]: With dead ends: 812 [2020-12-23 09:35:53,906 INFO L226 Difference]: Without dead ends: 495 [2020-12-23 09:35:53,907 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:53,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-23 09:35:53,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2020-12-23 09:35:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-23 09:35:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 800 transitions. [2020-12-23 09:35:53,941 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 800 transitions. Word has length 35 [2020-12-23 09:35:53,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:53,941 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 800 transitions. [2020-12-23 09:35:53,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 800 transitions. [2020-12-23 09:35:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:53,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:53,945 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] [2020-12-23 09:35:53,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:35:53,946 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:53,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:53,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2127880731, now seen corresponding path program 1 times [2020-12-23 09:35:53,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:53,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852508498] [2020-12-23 09:35:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:54,016 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:54,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852508498] [2020-12-23 09:35:54,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:54,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:54,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73438496] [2020-12-23 09:35:54,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:54,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:54,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:54,019 INFO L87 Difference]: Start difference. First operand 493 states and 800 transitions. Second operand 4 states. [2020-12-23 09:35:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:54,146 INFO L93 Difference]: Finished difference Result 1255 states and 2037 transitions. [2020-12-23 09:35:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:54,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-23 09:35:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:54,151 INFO L225 Difference]: With dead ends: 1255 [2020-12-23 09:35:54,151 INFO L226 Difference]: Without dead ends: 779 [2020-12-23 09:35:54,153 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:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-12-23 09:35:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 493. [2020-12-23 09:35:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-23 09:35:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 792 transitions. [2020-12-23 09:35:54,186 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 792 transitions. Word has length 35 [2020-12-23 09:35:54,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:54,186 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 792 transitions. [2020-12-23 09:35:54,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 792 transitions. [2020-12-23 09:35:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:54,187 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:54,187 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] [2020-12-23 09:35:54,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:35:54,188 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:54,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1106812377, now seen corresponding path program 1 times [2020-12-23 09:35:54,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:54,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613810674] [2020-12-23 09:35:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:54,226 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:54,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613810674] [2020-12-23 09:35:54,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:54,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:54,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048398226] [2020-12-23 09:35:54,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:54,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:54,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:54,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:54,229 INFO L87 Difference]: Start difference. First operand 493 states and 792 transitions. Second operand 4 states. [2020-12-23 09:35:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:54,364 INFO L93 Difference]: Finished difference Result 1251 states and 2010 transitions. [2020-12-23 09:35:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:54,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-23 09:35:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:54,373 INFO L225 Difference]: With dead ends: 1251 [2020-12-23 09:35:54,373 INFO L226 Difference]: Without dead ends: 781 [2020-12-23 09:35:54,376 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:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-12-23 09:35:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 493. [2020-12-23 09:35:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-23 09:35:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 784 transitions. [2020-12-23 09:35:54,414 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 784 transitions. Word has length 35 [2020-12-23 09:35:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:54,414 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 784 transitions. [2020-12-23 09:35:54,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 784 transitions. [2020-12-23 09:35:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:54,415 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:54,415 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] [2020-12-23 09:35:54,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:35:54,416 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:54,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:54,416 INFO L82 PathProgramCache]: Analyzing trace with hash 95695127, now seen corresponding path program 1 times [2020-12-23 09:35:54,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:54,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695731651] [2020-12-23 09:35:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:54,450 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:54,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695731651] [2020-12-23 09:35:54,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:54,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:54,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362881664] [2020-12-23 09:35:54,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:54,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:54,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:54,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:54,457 INFO L87 Difference]: Start difference. First operand 493 states and 784 transitions. Second operand 4 states. [2020-12-23 09:35:54,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:54,573 INFO L93 Difference]: Finished difference Result 1192 states and 1892 transitions. [2020-12-23 09:35:54,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:54,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-23 09:35:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:54,577 INFO L225 Difference]: With dead ends: 1192 [2020-12-23 09:35:54,577 INFO L226 Difference]: Without dead ends: 716 [2020-12-23 09:35:54,578 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:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-12-23 09:35:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 541. [2020-12-23 09:35:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-12-23 09:35:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 841 transitions. [2020-12-23 09:35:54,616 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 841 transitions. Word has length 35 [2020-12-23 09:35:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:54,616 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 841 transitions. [2020-12-23 09:35:54,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 841 transitions. [2020-12-23 09:35:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:35:54,617 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:54,617 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] [2020-12-23 09:35:54,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:35:54,617 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 353860565, now seen corresponding path program 1 times [2020-12-23 09:35:54,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:54,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648294203] [2020-12-23 09:35:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:54,649 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:54,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648294203] [2020-12-23 09:35:54,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:54,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:54,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536660860] [2020-12-23 09:35:54,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:54,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:54,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:54,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:54,652 INFO L87 Difference]: Start difference. First operand 541 states and 841 transitions. Second operand 3 states. [2020-12-23 09:35:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:54,738 INFO L93 Difference]: Finished difference Result 1288 states and 2008 transitions. [2020-12-23 09:35:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:54,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-23 09:35:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:54,743 INFO L225 Difference]: With dead ends: 1288 [2020-12-23 09:35:54,744 INFO L226 Difference]: Without dead ends: 761 [2020-12-23 09:35:54,745 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:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-12-23 09:35:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 758. [2020-12-23 09:35:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2020-12-23 09:35:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1165 transitions. [2020-12-23 09:35:54,806 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1165 transitions. Word has length 35 [2020-12-23 09:35:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:54,806 INFO L481 AbstractCegarLoop]: Abstraction has 758 states and 1165 transitions. [2020-12-23 09:35:54,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1165 transitions. [2020-12-23 09:35:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 09:35:54,807 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:54,808 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] [2020-12-23 09:35:54,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:35:54,808 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:54,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:54,809 INFO L82 PathProgramCache]: Analyzing trace with hash -209495903, now seen corresponding path program 1 times [2020-12-23 09:35:54,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:54,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150292894] [2020-12-23 09:35:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:54,840 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:54,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150292894] [2020-12-23 09:35:54,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:54,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:54,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983702143] [2020-12-23 09:35:54,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:54,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:54,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:54,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:54,843 INFO L87 Difference]: Start difference. First operand 758 states and 1165 transitions. Second operand 3 states. [2020-12-23 09:35:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:54,937 INFO L93 Difference]: Finished difference Result 1864 states and 2903 transitions. [2020-12-23 09:35:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:54,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-23 09:35:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:54,944 INFO L225 Difference]: With dead ends: 1864 [2020-12-23 09:35:54,944 INFO L226 Difference]: Without dead ends: 1133 [2020-12-23 09:35:54,946 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:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2020-12-23 09:35:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1131. [2020-12-23 09:35:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2020-12-23 09:35:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1752 transitions. [2020-12-23 09:35:55,028 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1752 transitions. Word has length 45 [2020-12-23 09:35:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:55,028 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1752 transitions. [2020-12-23 09:35:55,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1752 transitions. [2020-12-23 09:35:55,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 09:35:55,030 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:55,030 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] [2020-12-23 09:35:55,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:35:55,030 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:55,031 INFO L82 PathProgramCache]: Analyzing trace with hash 214150819, now seen corresponding path program 1 times [2020-12-23 09:35:55,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:55,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710693839] [2020-12-23 09:35:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:55,053 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:55,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710693839] [2020-12-23 09:35:55,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:55,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:55,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770820887] [2020-12-23 09:35:55,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:55,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:55,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:55,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:55,055 INFO L87 Difference]: Start difference. First operand 1131 states and 1752 transitions. Second operand 3 states. [2020-12-23 09:35:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:55,145 INFO L93 Difference]: Finished difference Result 2213 states and 3445 transitions. [2020-12-23 09:35:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:55,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-23 09:35:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:55,151 INFO L225 Difference]: With dead ends: 2213 [2020-12-23 09:35:55,151 INFO L226 Difference]: Without dead ends: 1109 [2020-12-23 09:35:55,169 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:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2020-12-23 09:35:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2020-12-23 09:35:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2020-12-23 09:35:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1725 transitions. [2020-12-23 09:35:55,255 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1725 transitions. Word has length 45 [2020-12-23 09:35:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:55,256 INFO L481 AbstractCegarLoop]: Abstraction has 1109 states and 1725 transitions. [2020-12-23 09:35:55,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1725 transitions. [2020-12-23 09:35:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 09:35:55,257 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:55,257 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:55,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:35:55,257 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:55,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1700232685, now seen corresponding path program 1 times [2020-12-23 09:35:55,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:55,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806797239] [2020-12-23 09:35:55,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:55,301 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:55,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806797239] [2020-12-23 09:35:55,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:55,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:55,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3400568] [2020-12-23 09:35:55,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:55,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:55,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:55,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:55,305 INFO L87 Difference]: Start difference. First operand 1109 states and 1725 transitions. Second operand 3 states. [2020-12-23 09:35:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:55,453 INFO L93 Difference]: Finished difference Result 2813 states and 4432 transitions. [2020-12-23 09:35:55,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:55,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-23 09:35:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:55,465 INFO L225 Difference]: With dead ends: 2813 [2020-12-23 09:35:55,465 INFO L226 Difference]: Without dead ends: 1731 [2020-12-23 09:35:55,470 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:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2020-12-23 09:35:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1729. [2020-12-23 09:35:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2020-12-23 09:35:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2711 transitions. [2020-12-23 09:35:55,639 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2711 transitions. Word has length 46 [2020-12-23 09:35:55,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:55,640 INFO L481 AbstractCegarLoop]: Abstraction has 1729 states and 2711 transitions. [2020-12-23 09:35:55,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2711 transitions. [2020-12-23 09:35:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-23 09:35:55,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:55,642 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:55,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:35:55,643 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1601371510, now seen corresponding path program 1 times [2020-12-23 09:35:55,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:55,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131544224] [2020-12-23 09:35:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:55,709 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:55,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131544224] [2020-12-23 09:35:55,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:55,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:55,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085350213] [2020-12-23 09:35:55,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:55,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:55,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:55,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:55,715 INFO L87 Difference]: Start difference. First operand 1729 states and 2711 transitions. Second operand 3 states. [2020-12-23 09:35:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:56,001 INFO L93 Difference]: Finished difference Result 4644 states and 7373 transitions. [2020-12-23 09:35:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:56,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-23 09:35:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:56,017 INFO L225 Difference]: With dead ends: 4644 [2020-12-23 09:35:56,018 INFO L226 Difference]: Without dead ends: 2944 [2020-12-23 09:35:56,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-12-23 09:35:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2942. [2020-12-23 09:35:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2020-12-23 09:35:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4650 transitions. [2020-12-23 09:35:56,266 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4650 transitions. Word has length 47 [2020-12-23 09:35:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:56,266 INFO L481 AbstractCegarLoop]: Abstraction has 2942 states and 4650 transitions. [2020-12-23 09:35:56,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4650 transitions. [2020-12-23 09:35:56,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-23 09:35:56,268 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:56,268 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:56,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:35:56,270 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:56,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2025018232, now seen corresponding path program 1 times [2020-12-23 09:35:56,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:56,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335452741] [2020-12-23 09:35:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:56,307 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:56,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335452741] [2020-12-23 09:35:56,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:56,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:56,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052107222] [2020-12-23 09:35:56,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:56,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:56,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:56,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:56,311 INFO L87 Difference]: Start difference. First operand 2942 states and 4650 transitions. Second operand 3 states. [2020-12-23 09:35:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:56,547 INFO L93 Difference]: Finished difference Result 5833 states and 9241 transitions. [2020-12-23 09:35:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:56,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-23 09:35:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:56,563 INFO L225 Difference]: With dead ends: 5833 [2020-12-23 09:35:56,563 INFO L226 Difference]: Without dead ends: 2920 [2020-12-23 09:35:56,569 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:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-12-23 09:35:56,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2020-12-23 09:35:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2020-12-23 09:35:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4624 transitions. [2020-12-23 09:35:56,816 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4624 transitions. Word has length 47 [2020-12-23 09:35:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:56,817 INFO L481 AbstractCegarLoop]: Abstraction has 2920 states and 4624 transitions. [2020-12-23 09:35:56,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:56,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4624 transitions. [2020-12-23 09:35:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 09:35:56,818 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:56,819 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:56,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:35:56,819 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:56,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:56,820 INFO L82 PathProgramCache]: Analyzing trace with hash -2129316584, now seen corresponding path program 1 times [2020-12-23 09:35:56,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:56,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308492996] [2020-12-23 09:35:56,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:56,859 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:56,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308492996] [2020-12-23 09:35:56,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:56,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:35:56,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227920357] [2020-12-23 09:35:56,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:56,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:56,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:56,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:56,867 INFO L87 Difference]: Start difference. First operand 2920 states and 4624 transitions. Second operand 4 states. [2020-12-23 09:35:57,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:57,280 INFO L93 Difference]: Finished difference Result 7421 states and 11813 transitions. [2020-12-23 09:35:57,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:35:57,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-12-23 09:35:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:57,301 INFO L225 Difference]: With dead ends: 7421 [2020-12-23 09:35:57,301 INFO L226 Difference]: Without dead ends: 3797 [2020-12-23 09:35:57,307 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:57,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2020-12-23 09:35:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3797. [2020-12-23 09:35:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2020-12-23 09:35:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 5990 transitions. [2020-12-23 09:35:57,666 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 5990 transitions. Word has length 48 [2020-12-23 09:35:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:57,667 INFO L481 AbstractCegarLoop]: Abstraction has 3797 states and 5990 transitions. [2020-12-23 09:35:57,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 5990 transitions. [2020-12-23 09:35:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 09:35:57,669 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:57,670 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] [2020-12-23 09:35:57,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:35:57,670 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:57,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:57,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1211370450, now seen corresponding path program 1 times [2020-12-23 09:35:57,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:57,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811506632] [2020-12-23 09:35:57,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:57,744 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:57,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811506632] [2020-12-23 09:35:57,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:57,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:57,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491916171] [2020-12-23 09:35:57,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:57,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:57,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:57,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:57,750 INFO L87 Difference]: Start difference. First operand 3797 states and 5990 transitions. Second operand 5 states. [2020-12-23 09:35:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:58,292 INFO L93 Difference]: Finished difference Result 9692 states and 15178 transitions. [2020-12-23 09:35:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 09:35:58,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-12-23 09:35:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:58,322 INFO L225 Difference]: With dead ends: 9692 [2020-12-23 09:35:58,323 INFO L226 Difference]: Without dead ends: 5918 [2020-12-23 09:35:58,328 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:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2020-12-23 09:35:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 4440. [2020-12-23 09:35:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4440 states. [2020-12-23 09:35:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6847 transitions. [2020-12-23 09:35:58,781 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6847 transitions. Word has length 53 [2020-12-23 09:35:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:58,781 INFO L481 AbstractCegarLoop]: Abstraction has 4440 states and 6847 transitions. [2020-12-23 09:35:58,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6847 transitions. [2020-12-23 09:35:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 09:35:58,791 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:58,791 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] [2020-12-23 09:35:58,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:35:58,792 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:58,792 INFO L82 PathProgramCache]: Analyzing trace with hash -826237841, now seen corresponding path program 1 times [2020-12-23 09:35:58,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:58,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062680446] [2020-12-23 09:35:58,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:58,838 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:58,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062680446] [2020-12-23 09:35:58,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:58,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:58,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680590962] [2020-12-23 09:35:58,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:58,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:58,840 INFO L87 Difference]: Start difference. First operand 4440 states and 6847 transitions. Second operand 3 states. [2020-12-23 09:35:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:59,264 INFO L93 Difference]: Finished difference Result 9203 states and 14160 transitions. [2020-12-23 09:35:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:59,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-23 09:35:59,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:59,297 INFO L225 Difference]: With dead ends: 9203 [2020-12-23 09:35:59,298 INFO L226 Difference]: Without dead ends: 4792 [2020-12-23 09:35:59,305 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:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2020-12-23 09:35:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4760. [2020-12-23 09:35:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4760 states. [2020-12-23 09:35:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 7096 transitions. [2020-12-23 09:35:59,764 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 7096 transitions. Word has length 85 [2020-12-23 09:35:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:59,764 INFO L481 AbstractCegarLoop]: Abstraction has 4760 states and 7096 transitions. [2020-12-23 09:35:59,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 7096 transitions. [2020-12-23 09:35:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 09:35:59,769 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:59,769 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:59,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:35:59,769 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:59,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:59,770 INFO L82 PathProgramCache]: Analyzing trace with hash -433884439, now seen corresponding path program 1 times [2020-12-23 09:35:59,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:59,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779767729] [2020-12-23 09:35:59,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:59,805 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:59,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779767729] [2020-12-23 09:35:59,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:59,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:59,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158764149] [2020-12-23 09:35:59,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:59,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:59,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:59,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:59,808 INFO L87 Difference]: Start difference. First operand 4760 states and 7096 transitions. Second operand 3 states. [2020-12-23 09:36:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:00,183 INFO L93 Difference]: Finished difference Result 10001 states and 14870 transitions. [2020-12-23 09:36:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:00,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 09:36:00,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:00,196 INFO L225 Difference]: With dead ends: 10001 [2020-12-23 09:36:00,196 INFO L226 Difference]: Without dead ends: 5282 [2020-12-23 09:36:00,204 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:36:00,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2020-12-23 09:36:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5234. [2020-12-23 09:36:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2020-12-23 09:36:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7539 transitions. [2020-12-23 09:36:00,621 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7539 transitions. Word has length 86 [2020-12-23 09:36:00,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:00,622 INFO L481 AbstractCegarLoop]: Abstraction has 5234 states and 7539 transitions. [2020-12-23 09:36:00,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7539 transitions. [2020-12-23 09:36:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 09:36:00,628 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:00,629 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:36:00,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:36:00,629 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:00,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1869450223, now seen corresponding path program 1 times [2020-12-23 09:36:00,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:00,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506101522] [2020-12-23 09:36:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:00,668 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:36:00,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506101522] [2020-12-23 09:36:00,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:00,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:00,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597171671] [2020-12-23 09:36:00,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:00,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:00,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:00,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:00,671 INFO L87 Difference]: Start difference. First operand 5234 states and 7539 transitions. Second operand 3 states. [2020-12-23 09:36:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:01,131 INFO L93 Difference]: Finished difference Result 10775 states and 15529 transitions. [2020-12-23 09:36:01,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:01,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-23 09:36:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:01,144 INFO L225 Difference]: With dead ends: 10775 [2020-12-23 09:36:01,144 INFO L226 Difference]: Without dead ends: 5602 [2020-12-23 09:36:01,152 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:36:01,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2020-12-23 09:36:01,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 5024. [2020-12-23 09:36:01,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5024 states. [2020-12-23 09:36:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5024 states to 5024 states and 6917 transitions. [2020-12-23 09:36:01,470 INFO L78 Accepts]: Start accepts. Automaton has 5024 states and 6917 transitions. Word has length 87 [2020-12-23 09:36:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:01,471 INFO L481 AbstractCegarLoop]: Abstraction has 5024 states and 6917 transitions. [2020-12-23 09:36:01,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 5024 states and 6917 transitions. [2020-12-23 09:36:01,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 09:36:01,476 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:01,477 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:36:01,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:36:01,477 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2059863225, now seen corresponding path program 1 times [2020-12-23 09:36:01,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:01,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372554230] [2020-12-23 09:36:01,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:01,526 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:36:01,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372554230] [2020-12-23 09:36:01,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:01,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:36:01,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241515366] [2020-12-23 09:36:01,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:01,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:01,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:01,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:01,529 INFO L87 Difference]: Start difference. First operand 5024 states and 6917 transitions. Second operand 4 states. [2020-12-23 09:36:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:02,386 INFO L93 Difference]: Finished difference Result 9412 states and 12909 transitions. [2020-12-23 09:36:02,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:36:02,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 09:36:02,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:02,400 INFO L225 Difference]: With dead ends: 9412 [2020-12-23 09:36:02,401 INFO L226 Difference]: Without dead ends: 4839 [2020-12-23 09:36:02,408 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:36:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2020-12-23 09:36:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 4725. [2020-12-23 09:36:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2020-12-23 09:36:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 6299 transitions. [2020-12-23 09:36:02,879 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 6299 transitions. Word has length 88 [2020-12-23 09:36:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:02,879 INFO L481 AbstractCegarLoop]: Abstraction has 4725 states and 6299 transitions. [2020-12-23 09:36:02,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 6299 transitions. [2020-12-23 09:36:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 09:36:02,891 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:02,892 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] [2020-12-23 09:36:02,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:36:02,894 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:02,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:02,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1061949686, now seen corresponding path program 1 times [2020-12-23 09:36:02,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:02,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088980637] [2020-12-23 09:36:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:02,974 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:36:02,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088980637] [2020-12-23 09:36:02,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:02,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:02,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293827406] [2020-12-23 09:36:02,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:02,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:02,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:02,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:02,980 INFO L87 Difference]: Start difference. First operand 4725 states and 6299 transitions. Second operand 3 states. [2020-12-23 09:36:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:03,437 INFO L93 Difference]: Finished difference Result 9005 states and 11995 transitions. [2020-12-23 09:36:03,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:03,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-12-23 09:36:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:03,448 INFO L225 Difference]: With dead ends: 9005 [2020-12-23 09:36:03,449 INFO L226 Difference]: Without dead ends: 4671 [2020-12-23 09:36:03,455 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:36:03,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2020-12-23 09:36:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4671. [2020-12-23 09:36:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4671 states. [2020-12-23 09:36:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 6193 transitions. [2020-12-23 09:36:03,865 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 6193 transitions. Word has length 115 [2020-12-23 09:36:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:03,866 INFO L481 AbstractCegarLoop]: Abstraction has 4671 states and 6193 transitions. [2020-12-23 09:36:03,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 6193 transitions. [2020-12-23 09:36:03,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-23 09:36:03,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:03,876 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] [2020-12-23 09:36:03,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:36:03,877 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:03,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:03,877 INFO L82 PathProgramCache]: Analyzing trace with hash 314934891, now seen corresponding path program 1 times [2020-12-23 09:36:03,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:03,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391620841] [2020-12-23 09:36:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:03,926 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:36:03,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391620841] [2020-12-23 09:36:03,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:03,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:36:03,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618429288] [2020-12-23 09:36:03,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:03,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:03,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:03,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:03,929 INFO L87 Difference]: Start difference. First operand 4671 states and 6193 transitions. Second operand 4 states. [2020-12-23 09:36:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:04,368 INFO L93 Difference]: Finished difference Result 8293 states and 11017 transitions. [2020-12-23 09:36:04,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:36:04,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2020-12-23 09:36:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:04,376 INFO L225 Difference]: With dead ends: 8293 [2020-12-23 09:36:04,377 INFO L226 Difference]: Without dead ends: 4591 [2020-12-23 09:36:04,381 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:36:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2020-12-23 09:36:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4589. [2020-12-23 09:36:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4589 states. [2020-12-23 09:36:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 5972 transitions. [2020-12-23 09:36:04,681 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 5972 transitions. Word has length 127 [2020-12-23 09:36:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:04,681 INFO L481 AbstractCegarLoop]: Abstraction has 4589 states and 5972 transitions. [2020-12-23 09:36:04,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 5972 transitions. [2020-12-23 09:36:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:36:04,690 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:04,690 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] [2020-12-23 09:36:04,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:36:04,690 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:04,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash -146147841, now seen corresponding path program 1 times [2020-12-23 09:36:04,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:04,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282012722] [2020-12-23 09:36:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:04,736 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:36:04,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282012722] [2020-12-23 09:36:04,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:04,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:04,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521043740] [2020-12-23 09:36:04,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:04,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:04,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:04,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:04,738 INFO L87 Difference]: Start difference. First operand 4589 states and 5972 transitions. Second operand 3 states. [2020-12-23 09:36:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:05,013 INFO L93 Difference]: Finished difference Result 8787 states and 11424 transitions. [2020-12-23 09:36:05,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:05,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:36:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:05,023 INFO L225 Difference]: With dead ends: 8787 [2020-12-23 09:36:05,024 INFO L226 Difference]: Without dead ends: 4589 [2020-12-23 09:36:05,029 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:36:05,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2020-12-23 09:36:05,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4549. [2020-12-23 09:36:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2020-12-23 09:36:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 5890 transitions. [2020-12-23 09:36:05,473 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 5890 transitions. Word has length 133 [2020-12-23 09:36:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:05,474 INFO L481 AbstractCegarLoop]: Abstraction has 4549 states and 5890 transitions. [2020-12-23 09:36:05,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 5890 transitions. [2020-12-23 09:36:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:36:05,483 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:05,483 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] [2020-12-23 09:36:05,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:36:05,483 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:05,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1797709215, now seen corresponding path program 1 times [2020-12-23 09:36:05,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:05,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079625668] [2020-12-23 09:36:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:05,530 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:36:05,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079625668] [2020-12-23 09:36:05,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:05,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:05,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604746434] [2020-12-23 09:36:05,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:05,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:05,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:05,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:05,532 INFO L87 Difference]: Start difference. First operand 4549 states and 5890 transitions. Second operand 3 states. [2020-12-23 09:36:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:05,819 INFO L93 Difference]: Finished difference Result 8735 states and 11302 transitions. [2020-12-23 09:36:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:05,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:36:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:05,827 INFO L225 Difference]: With dead ends: 8735 [2020-12-23 09:36:05,827 INFO L226 Difference]: Without dead ends: 4558 [2020-12-23 09:36:05,833 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:36:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2020-12-23 09:36:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 4518. [2020-12-23 09:36:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2020-12-23 09:36:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5818 transitions. [2020-12-23 09:36:06,353 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5818 transitions. Word has length 133 [2020-12-23 09:36:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:06,353 INFO L481 AbstractCegarLoop]: Abstraction has 4518 states and 5818 transitions. [2020-12-23 09:36:06,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5818 transitions. [2020-12-23 09:36:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-23 09:36:06,365 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:06,365 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] [2020-12-23 09:36:06,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:36:06,366 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:06,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:06,367 INFO L82 PathProgramCache]: Analyzing trace with hash 282610594, now seen corresponding path program 1 times [2020-12-23 09:36:06,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:06,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059661786] [2020-12-23 09:36:06,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:06,504 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:36:06,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059661786] [2020-12-23 09:36:06,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:06,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:36:06,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261500983] [2020-12-23 09:36:06,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:06,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:06,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:06,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:06,508 INFO L87 Difference]: Start difference. First operand 4518 states and 5818 transitions. Second operand 4 states. [2020-12-23 09:36:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:06,951 INFO L93 Difference]: Finished difference Result 7327 states and 9468 transitions. [2020-12-23 09:36:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:36:06,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-12-23 09:36:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:06,956 INFO L225 Difference]: With dead ends: 7327 [2020-12-23 09:36:06,957 INFO L226 Difference]: Without dead ends: 3182 [2020-12-23 09:36:06,961 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:36:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2020-12-23 09:36:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3180. [2020-12-23 09:36:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3180 states. [2020-12-23 09:36:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4000 transitions. [2020-12-23 09:36:07,365 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4000 transitions. Word has length 136 [2020-12-23 09:36:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:07,366 INFO L481 AbstractCegarLoop]: Abstraction has 3180 states and 4000 transitions. [2020-12-23 09:36:07,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4000 transitions. [2020-12-23 09:36:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-23 09:36:07,372 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:07,372 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] [2020-12-23 09:36:07,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:36:07,372 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:07,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1519116211, now seen corresponding path program 1 times [2020-12-23 09:36:07,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:07,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464139486] [2020-12-23 09:36:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:07,439 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:36:07,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464139486] [2020-12-23 09:36:07,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:07,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:36:07,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661137065] [2020-12-23 09:36:07,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:07,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:07,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:07,442 INFO L87 Difference]: Start difference. First operand 3180 states and 4000 transitions. Second operand 4 states. [2020-12-23 09:36:07,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:07,649 INFO L93 Difference]: Finished difference Result 5150 states and 6486 transitions. [2020-12-23 09:36:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:36:07,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-12-23 09:36:07,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:07,651 INFO L225 Difference]: With dead ends: 5150 [2020-12-23 09:36:07,651 INFO L226 Difference]: Without dead ends: 2043 [2020-12-23 09:36:07,655 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:36:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2020-12-23 09:36:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2041. [2020-12-23 09:36:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2020-12-23 09:36:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2486 transitions. [2020-12-23 09:36:07,828 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2486 transitions. Word has length 136 [2020-12-23 09:36:07,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:07,828 INFO L481 AbstractCegarLoop]: Abstraction has 2041 states and 2486 transitions. [2020-12-23 09:36:07,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2486 transitions. [2020-12-23 09:36:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-12-23 09:36:07,831 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:07,831 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] [2020-12-23 09:36:07,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:36:07,831 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:07,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:07,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1947572035, now seen corresponding path program 1 times [2020-12-23 09:36:07,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:07,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079371395] [2020-12-23 09:36:07,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:07,883 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:36:07,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079371395] [2020-12-23 09:36:07,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:07,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:07,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18188729] [2020-12-23 09:36:07,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:07,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:07,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:07,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:07,885 INFO L87 Difference]: Start difference. First operand 2041 states and 2486 transitions. Second operand 3 states. [2020-12-23 09:36:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:08,114 INFO L93 Difference]: Finished difference Result 3699 states and 4535 transitions. [2020-12-23 09:36:08,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:08,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-12-23 09:36:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:08,116 INFO L225 Difference]: With dead ends: 3699 [2020-12-23 09:36:08,116 INFO L226 Difference]: Without dead ends: 1999 [2020-12-23 09:36:08,118 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:36:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2020-12-23 09:36:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1931. [2020-12-23 09:36:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2020-12-23 09:36:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2328 transitions. [2020-12-23 09:36:08,257 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2328 transitions. Word has length 175 [2020-12-23 09:36:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:08,257 INFO L481 AbstractCegarLoop]: Abstraction has 1931 states and 2328 transitions. [2020-12-23 09:36:08,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2328 transitions. [2020-12-23 09:36:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-12-23 09:36:08,259 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:08,259 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] [2020-12-23 09:36:08,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 09:36:08,260 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:08,260 INFO L82 PathProgramCache]: Analyzing trace with hash 640476680, now seen corresponding path program 1 times [2020-12-23 09:36:08,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:08,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574034239] [2020-12-23 09:36:08,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:08,342 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:36:08,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574034239] [2020-12-23 09:36:08,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:08,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:08,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50627405] [2020-12-23 09:36:08,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:08,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:08,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:08,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:08,344 INFO L87 Difference]: Start difference. First operand 1931 states and 2328 transitions. Second operand 3 states. [2020-12-23 09:36:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:08,523 INFO L93 Difference]: Finished difference Result 4154 states and 5043 transitions. [2020-12-23 09:36:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:08,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2020-12-23 09:36:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:08,526 INFO L225 Difference]: With dead ends: 4154 [2020-12-23 09:36:08,527 INFO L226 Difference]: Without dead ends: 2560 [2020-12-23 09:36:08,528 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:36:08,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2020-12-23 09:36:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2209. [2020-12-23 09:36:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2020-12-23 09:36:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2628 transitions. [2020-12-23 09:36:08,715 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2628 transitions. Word has length 181 [2020-12-23 09:36:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:08,715 INFO L481 AbstractCegarLoop]: Abstraction has 2209 states and 2628 transitions. [2020-12-23 09:36:08,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2628 transitions. [2020-12-23 09:36:08,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-12-23 09:36:08,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:08,717 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] [2020-12-23 09:36:08,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 09:36:08,717 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:08,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:08,718 INFO L82 PathProgramCache]: Analyzing trace with hash -646225786, now seen corresponding path program 1 times [2020-12-23 09:36:08,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:08,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991701087] [2020-12-23 09:36:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-23 09:36:08,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991701087] [2020-12-23 09:36:08,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:08,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:08,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099935256] [2020-12-23 09:36:08,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:08,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:08,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:08,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:08,776 INFO L87 Difference]: Start difference. First operand 2209 states and 2628 transitions. Second operand 3 states. [2020-12-23 09:36:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:08,949 INFO L93 Difference]: Finished difference Result 3746 states and 4490 transitions. [2020-12-23 09:36:08,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:08,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2020-12-23 09:36:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:08,951 INFO L225 Difference]: With dead ends: 3746 [2020-12-23 09:36:08,951 INFO L226 Difference]: Without dead ends: 1872 [2020-12-23 09:36:08,952 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:36:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2020-12-23 09:36:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1793. [2020-12-23 09:36:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2020-12-23 09:36:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2102 transitions. [2020-12-23 09:36:09,067 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2102 transitions. Word has length 184 [2020-12-23 09:36:09,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:09,068 INFO L481 AbstractCegarLoop]: Abstraction has 1793 states and 2102 transitions. [2020-12-23 09:36:09,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2102 transitions. [2020-12-23 09:36:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-12-23 09:36:09,069 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:09,069 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] [2020-12-23 09:36:09,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 09:36:09,069 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:09,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1772258692, now seen corresponding path program 1 times [2020-12-23 09:36:09,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:09,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051335273] [2020-12-23 09:36:09,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:36:09,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:36:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:36:09,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:36:09,202 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 09:36:09,202 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 09:36:09,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 09:36:09,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:36:09 BoogieIcfgContainer [2020-12-23 09:36:09,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 09:36:09,447 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 09:36:09,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 09:36:09,448 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 09:36:09,448 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:51" (3/4) ... [2020-12-23 09:36:09,450 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 09:36:09,648 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/toy2.cil.c-witness.graphml [2020-12-23 09:36:09,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 09:36:09,650 INFO L168 Benchmark]: Toolchain (without parser) took 19491.47 ms. Allocated memory was 157.3 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 132.9 MB in the beginning and 800.3 MB in the end (delta: -667.3 MB). Peak memory consumption was 624.7 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:09,651 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 157.3 MB. Free memory is still 130.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:36:09,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.28 ms. Allocated memory is still 157.3 MB. Free memory was 132.7 MB in the beginning and 118.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:09,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.87 ms. Allocated memory is still 157.3 MB. Free memory was 118.2 MB in the beginning and 116.0 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:09,652 INFO L168 Benchmark]: Boogie Preprocessor took 59.61 ms. Allocated memory is still 157.3 MB. Free memory was 116.0 MB in the beginning and 113.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:09,652 INFO L168 Benchmark]: RCFGBuilder took 956.21 ms. Allocated memory is still 157.3 MB. Free memory was 113.9 MB in the beginning and 106.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:09,652 INFO L168 Benchmark]: TraceAbstraction took 17781.61 ms. Allocated memory was 157.3 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 105.4 MB in the beginning and 837.1 MB in the end (delta: -731.7 MB). Peak memory consumption was 560.2 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:09,653 INFO L168 Benchmark]: Witness Printer took 200.51 ms. Allocated memory is still 1.4 GB. Free memory was 836.6 MB in the beginning and 800.3 MB in the end (delta: 36.3 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:09,655 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.26 ms. Allocated memory is still 157.3 MB. Free memory is still 130.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 416.28 ms. Allocated memory is still 157.3 MB. Free memory was 132.7 MB in the beginning and 118.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 60.87 ms. Allocated memory is still 157.3 MB. Free memory was 118.2 MB in the beginning and 116.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 59.61 ms. Allocated memory is still 157.3 MB. Free memory was 116.0 MB in the beginning and 113.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 956.21 ms. Allocated memory is still 157.3 MB. Free memory was 113.9 MB in the beginning and 106.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17781.61 ms. Allocated memory was 157.3 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 105.4 MB in the beginning and 837.1 MB in the end (delta: -731.7 MB). Peak memory consumption was 560.2 MB. Max. memory is 8.0 GB. * Witness Printer took 200.51 ms. Allocated memory is still 1.4 GB. Free memory was 836.6 MB in the beginning and 800.3 MB in the end (delta: 36.3 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L396] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L475] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L484] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L493] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L502] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L507] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L512] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L517] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L129] COND TRUE (int )c1_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L174] COND TRUE (int )c2_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L219] COND TRUE (int )wb_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L540] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L551] kernel_st = 3 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L567] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L572] COND TRUE (int )e_wl == 0 [L573] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L578] COND TRUE (int )e_wl == 1 [L579] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L595] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L596] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L604] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L605] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L613] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L614] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L622] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L627] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L632] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L637] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L642] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L647] COND TRUE (int )e_wl == 1 [L648] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L85] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L129] COND FALSE !((int )c1_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L132] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L147] COND TRUE ! processed [L148] data += 1 [L149] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L150] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L151] COND TRUE (int )e_g == 1 [L152] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L159] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L174] COND FALSE !((int )c2_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L177] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L192] COND TRUE ! processed [L193] data += 1 [L194] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L195] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L196] COND TRUE (int )e_g == 1 [L197] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L204] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L219] COND FALSE !((int )wb_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L222] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L237] c_t = data [L238] c_req_up = 1 [L239] processed = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L540] COND TRUE (int )c_req_up == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L541] COND TRUE c != c_t [L542] c = c_t [L543] e_c = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L547] c_req_up = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L551] kernel_st = 3 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L567] COND TRUE (int )e_c == 0 [L568] e_c = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L572] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L585] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L586] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L595] COND TRUE (int )c1_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L596] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L604] COND TRUE (int )c2_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L613] COND TRUE (int )wb_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L614] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L622] COND TRUE (int )e_c == 1 [L623] r_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L627] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L632] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L637] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L642] COND TRUE (int )e_c == 1 [L643] e_c = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L647] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L655] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L658] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L661] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L533] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L339] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L354] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND TRUE (int )r_st == 0 [L371] tmp___3 = __VERIFIER_nondet_int() [L373] COND TRUE \read(tmp___3) [L375] r_st = 1 [L251] d = c [L252] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L253] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L261] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L262] COND TRUE (int )e_e == 1 [L263] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L271] e_e = 2 [L272] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L15] reach_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.4s, OverallIterations: 33, TraceHistogramMax: 6, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6387 SDtfs, 7478 SDslu, 3842 SDs, 0 SdLazy, 674 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5234occurred 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: 6.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 4252 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2601 NumberOfCodeBlocks, 2601 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2385 ConstructedInterpolants, 0 QuantifiedInterpolants, 376157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 704/704 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...