/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/mem_slave_tlm.4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:29:05,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:29:05,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:29:06,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:29:06,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:29:06,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:29:06,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:29:06,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:29:06,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:29:06,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:29:06,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:29:06,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:29:06,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:29:06,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:29:06,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:29:06,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:29:06,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:29:06,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:29:06,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:29:06,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:29:06,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:29:06,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:29:06,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:29:06,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:29:06,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:29:06,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:29:06,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:29:06,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:29:06,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:29:06,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:29:06,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:29:06,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:29:06,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:29:06,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:29:06,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:29:06,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:29:06,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:29:06,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:29:06,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:29:06,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:29:06,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:29:06,152 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:29:06,213 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:29:06,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:29:06,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:29:06,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:29:06,218 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:29:06,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:29:06,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:29:06,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:29:06,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:29:06,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:29:06,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:29:06,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:29:06,220 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:29:06,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:29:06,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:29:06,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:29:06,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:29:06,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:29:06,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:29:06,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:29:06,222 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:29:06,222 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:29:06,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:29:06,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:29:06,223 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:29:06,223 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:29:06,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:29:06,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:29:06,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:29:06,651 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:29:06,652 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:29:06,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.c [2020-12-23 09:29:06,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6baf8c563/4d7ac4c9b16449cab0fd71e0de6b73bb/FLAG11a50788e [2020-12-23 09:29:07,434 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:29:07,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.c [2020-12-23 09:29:07,452 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6baf8c563/4d7ac4c9b16449cab0fd71e0de6b73bb/FLAG11a50788e [2020-12-23 09:29:07,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6baf8c563/4d7ac4c9b16449cab0fd71e0de6b73bb [2020-12-23 09:29:07,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:29:07,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:29:07,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:29:07,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:29:07,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:29:07,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:29:07" (1/1) ... [2020-12-23 09:29:07,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fd6660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:07, skipping insertion in model container [2020-12-23 09:29:07,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:29:07" (1/1) ... [2020-12-23 09:29:07,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:29:07,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:29:08,106 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/mem_slave_tlm.4.cil.c[341,354] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~s_memory0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~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[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2020-12-23 09:29:08,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:29:08,369 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:29:08,383 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/mem_slave_tlm.4.cil.c[341,354] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~s_memory0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~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[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2020-12-23 09:29:08,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:29:08,521 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:29:08,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:08 WrapperNode [2020-12-23 09:29:08,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:29:08,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:29:08,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:29:08,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:29:08,557 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:29:08" (1/1) ... [2020-12-23 09:29:08,586 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:29:08" (1/1) ... [2020-12-23 09:29:08,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:29:08,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:29:08,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:29:08,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:29:08,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:08" (1/1) ... [2020-12-23 09:29:08,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:08" (1/1) ... [2020-12-23 09:29:08,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:08" (1/1) ... [2020-12-23 09:29:08,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:08" (1/1) ... [2020-12-23 09:29:08,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:08" (1/1) ... [2020-12-23 09:29:08,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:08" (1/1) ... [2020-12-23 09:29:08,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:08" (1/1) ... [2020-12-23 09:29:08,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:29:08,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:29:08,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:29:08,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:29:08,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:08" (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:29:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:29:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:29:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:29:08,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:29:10,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:29:10,233 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2020-12-23 09:29:10,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:29:10 BoogieIcfgContainer [2020-12-23 09:29:10,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:29:10,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:29:10,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:29:10,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:29:10,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:29:07" (1/3) ... [2020-12-23 09:29:10,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422b273a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:29:10, skipping insertion in model container [2020-12-23 09:29:10,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:08" (2/3) ... [2020-12-23 09:29:10,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422b273a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:29:10, skipping insertion in model container [2020-12-23 09:29:10,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:29:10" (3/3) ... [2020-12-23 09:29:10,245 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.4.cil.c [2020-12-23 09:29:10,252 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:29:10,258 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-23 09:29:10,277 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-23 09:29:10,308 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:29:10,309 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:29:10,309 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:29:10,309 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:29:10,309 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:29:10,310 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:29:10,310 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:29:10,310 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:29:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2020-12-23 09:29:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 09:29:10,345 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:10,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:10,347 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:10,354 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2020-12-23 09:29:10,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:10,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218270148] [2020-12-23 09:29:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:10,597 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:29:10,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218270148] [2020-12-23 09:29:10,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:10,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:10,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068022673] [2020-12-23 09:29:10,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:10,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:10,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:10,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:10,625 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 3 states. [2020-12-23 09:29:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:11,251 INFO L93 Difference]: Finished difference Result 731 states and 1328 transitions. [2020-12-23 09:29:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:11,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-23 09:29:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:11,272 INFO L225 Difference]: With dead ends: 731 [2020-12-23 09:29:11,272 INFO L226 Difference]: Without dead ends: 452 [2020-12-23 09:29:11,277 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:29:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-12-23 09:29:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 436. [2020-12-23 09:29:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-12-23 09:29:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 690 transitions. [2020-12-23 09:29:11,381 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 690 transitions. Word has length 28 [2020-12-23 09:29:11,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:11,382 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 690 transitions. [2020-12-23 09:29:11,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 690 transitions. [2020-12-23 09:29:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:29:11,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:11,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, 1, 1, 1, 1] [2020-12-23 09:29:11,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:29:11,387 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1067368876, now seen corresponding path program 1 times [2020-12-23 09:29:11,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:11,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890184541] [2020-12-23 09:29:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:11,490 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:29:11,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890184541] [2020-12-23 09:29:11,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:11,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:11,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877799484] [2020-12-23 09:29:11,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:11,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:11,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:11,497 INFO L87 Difference]: Start difference. First operand 436 states and 690 transitions. Second operand 3 states. [2020-12-23 09:29:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:11,657 INFO L93 Difference]: Finished difference Result 1147 states and 1839 transitions. [2020-12-23 09:29:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:11,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-23 09:29:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:11,664 INFO L225 Difference]: With dead ends: 1147 [2020-12-23 09:29:11,664 INFO L226 Difference]: Without dead ends: 725 [2020-12-23 09:29:11,667 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:29:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2020-12-23 09:29:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 709. [2020-12-23 09:29:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2020-12-23 09:29:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1153 transitions. [2020-12-23 09:29:11,726 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1153 transitions. Word has length 39 [2020-12-23 09:29:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:11,726 INFO L481 AbstractCegarLoop]: Abstraction has 709 states and 1153 transitions. [2020-12-23 09:29:11,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1153 transitions. [2020-12-23 09:29:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 09:29:11,731 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:11,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:11,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:29:11,732 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:11,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:11,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1759790175, now seen corresponding path program 1 times [2020-12-23 09:29:11,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:11,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479054102] [2020-12-23 09:29:11,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:11,849 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:29:11,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479054102] [2020-12-23 09:29:11,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:11,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:11,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136407420] [2020-12-23 09:29:11,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:11,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:11,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:11,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:11,853 INFO L87 Difference]: Start difference. First operand 709 states and 1153 transitions. Second operand 3 states. [2020-12-23 09:29:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:11,921 INFO L93 Difference]: Finished difference Result 1779 states and 2892 transitions. [2020-12-23 09:29:11,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:11,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-12-23 09:29:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:11,929 INFO L225 Difference]: With dead ends: 1779 [2020-12-23 09:29:11,929 INFO L226 Difference]: Without dead ends: 1095 [2020-12-23 09:29:11,931 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:29:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2020-12-23 09:29:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1083. [2020-12-23 09:29:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2020-12-23 09:29:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1756 transitions. [2020-12-23 09:29:11,983 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1756 transitions. Word has length 40 [2020-12-23 09:29:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:11,983 INFO L481 AbstractCegarLoop]: Abstraction has 1083 states and 1756 transitions. [2020-12-23 09:29:11,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1756 transitions. [2020-12-23 09:29:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 09:29:11,986 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:11,986 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:29:11,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:29:11,986 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash -361630758, now seen corresponding path program 1 times [2020-12-23 09:29:11,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:11,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705243044] [2020-12-23 09:29:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:12,071 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:29:12,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705243044] [2020-12-23 09:29:12,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:12,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:29:12,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577564731] [2020-12-23 09:29:12,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:29:12,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:12,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:29:12,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:12,074 INFO L87 Difference]: Start difference. First operand 1083 states and 1756 transitions. Second operand 4 states. [2020-12-23 09:29:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:12,474 INFO L93 Difference]: Finished difference Result 2981 states and 4817 transitions. [2020-12-23 09:29:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:29:12,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2020-12-23 09:29:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:12,486 INFO L225 Difference]: With dead ends: 2981 [2020-12-23 09:29:12,487 INFO L226 Difference]: Without dead ends: 1923 [2020-12-23 09:29:12,489 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:29:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2020-12-23 09:29:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1693. [2020-12-23 09:29:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1693 states. [2020-12-23 09:29:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2712 transitions. [2020-12-23 09:29:12,573 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2712 transitions. Word has length 46 [2020-12-23 09:29:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:12,573 INFO L481 AbstractCegarLoop]: Abstraction has 1693 states and 2712 transitions. [2020-12-23 09:29:12,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:29:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2712 transitions. [2020-12-23 09:29:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 09:29:12,575 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:12,575 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:12,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:29:12,576 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:12,576 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2020-12-23 09:29:12,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:12,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591043558] [2020-12-23 09:29:12,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:12,642 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:29:12,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591043558] [2020-12-23 09:29:12,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:12,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:29:12,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508025116] [2020-12-23 09:29:12,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:29:12,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:12,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:29:12,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:12,648 INFO L87 Difference]: Start difference. First operand 1693 states and 2712 transitions. Second operand 4 states. [2020-12-23 09:29:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:13,177 INFO L93 Difference]: Finished difference Result 5041 states and 7972 transitions. [2020-12-23 09:29:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:29:13,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-23 09:29:13,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:13,200 INFO L225 Difference]: With dead ends: 5041 [2020-12-23 09:29:13,200 INFO L226 Difference]: Without dead ends: 3367 [2020-12-23 09:29:13,205 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:29:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2020-12-23 09:29:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 2985. [2020-12-23 09:29:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2985 states. [2020-12-23 09:29:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4711 transitions. [2020-12-23 09:29:13,398 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 4711 transitions. Word has length 52 [2020-12-23 09:29:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:13,399 INFO L481 AbstractCegarLoop]: Abstraction has 2985 states and 4711 transitions. [2020-12-23 09:29:13,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:29:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4711 transitions. [2020-12-23 09:29:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 09:29:13,401 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:13,401 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:13,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:29:13,402 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2020-12-23 09:29:13,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:13,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787955225] [2020-12-23 09:29:13,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:13,452 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:29:13,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787955225] [2020-12-23 09:29:13,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:13,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:13,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661397278] [2020-12-23 09:29:13,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:13,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:13,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:13,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:13,455 INFO L87 Difference]: Start difference. First operand 2985 states and 4711 transitions. Second operand 3 states. [2020-12-23 09:29:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:13,649 INFO L93 Difference]: Finished difference Result 7023 states and 11042 transitions. [2020-12-23 09:29:13,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:13,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-12-23 09:29:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:13,673 INFO L225 Difference]: With dead ends: 7023 [2020-12-23 09:29:13,674 INFO L226 Difference]: Without dead ends: 4061 [2020-12-23 09:29:13,680 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:29:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states. [2020-12-23 09:29:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 3877. [2020-12-23 09:29:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3877 states. [2020-12-23 09:29:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 6045 transitions. [2020-12-23 09:29:13,951 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 6045 transitions. Word has length 52 [2020-12-23 09:29:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:13,953 INFO L481 AbstractCegarLoop]: Abstraction has 3877 states and 6045 transitions. [2020-12-23 09:29:13,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 6045 transitions. [2020-12-23 09:29:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 09:29:13,957 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:13,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:13,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:29:13,957 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:13,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:13,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1227642575, now seen corresponding path program 1 times [2020-12-23 09:29:13,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:13,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677600561] [2020-12-23 09:29:13,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:14,066 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:29:14,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677600561] [2020-12-23 09:29:14,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:14,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:14,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138204324] [2020-12-23 09:29:14,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:14,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:14,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:14,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:14,070 INFO L87 Difference]: Start difference. First operand 3877 states and 6045 transitions. Second operand 3 states. [2020-12-23 09:29:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:14,551 INFO L93 Difference]: Finished difference Result 9323 states and 14657 transitions. [2020-12-23 09:29:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:14,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-12-23 09:29:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:14,582 INFO L225 Difference]: With dead ends: 9323 [2020-12-23 09:29:14,583 INFO L226 Difference]: Without dead ends: 5469 [2020-12-23 09:29:14,590 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:29:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2020-12-23 09:29:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 4695. [2020-12-23 09:29:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4695 states. [2020-12-23 09:29:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 7058 transitions. [2020-12-23 09:29:14,819 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 7058 transitions. Word has length 59 [2020-12-23 09:29:14,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:14,819 INFO L481 AbstractCegarLoop]: Abstraction has 4695 states and 7058 transitions. [2020-12-23 09:29:14,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 7058 transitions. [2020-12-23 09:29:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:29:14,822 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:14,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:14,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:29:14,823 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:14,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:14,823 INFO L82 PathProgramCache]: Analyzing trace with hash -758236603, now seen corresponding path program 1 times [2020-12-23 09:29:14,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:14,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005096723] [2020-12-23 09:29:14,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:14,928 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:29:14,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005096723] [2020-12-23 09:29:14,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:14,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:14,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493227643] [2020-12-23 09:29:14,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:14,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:14,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:14,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:14,934 INFO L87 Difference]: Start difference. First operand 4695 states and 7058 transitions. Second operand 3 states. [2020-12-23 09:29:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:15,200 INFO L93 Difference]: Finished difference Result 9233 states and 13893 transitions. [2020-12-23 09:29:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:15,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:29:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:15,226 INFO L225 Difference]: With dead ends: 9233 [2020-12-23 09:29:15,227 INFO L226 Difference]: Without dead ends: 4561 [2020-12-23 09:29:15,235 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:29:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4561 states. [2020-12-23 09:29:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4561 to 4561. [2020-12-23 09:29:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4561 states. [2020-12-23 09:29:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 6757 transitions. [2020-12-23 09:29:15,468 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 6757 transitions. Word has length 61 [2020-12-23 09:29:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:15,469 INFO L481 AbstractCegarLoop]: Abstraction has 4561 states and 6757 transitions. [2020-12-23 09:29:15,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 6757 transitions. [2020-12-23 09:29:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 09:29:15,473 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:15,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:15,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:29:15,474 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:15,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1625860633, now seen corresponding path program 1 times [2020-12-23 09:29:15,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:15,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983120331] [2020-12-23 09:29:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:15,541 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:29:15,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983120331] [2020-12-23 09:29:15,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:15,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:15,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135203039] [2020-12-23 09:29:15,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:15,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:15,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:15,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:15,554 INFO L87 Difference]: Start difference. First operand 4561 states and 6757 transitions. Second operand 3 states. [2020-12-23 09:29:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:15,846 INFO L93 Difference]: Finished difference Result 9769 states and 14632 transitions. [2020-12-23 09:29:15,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:15,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-12-23 09:29:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:15,892 INFO L225 Difference]: With dead ends: 9769 [2020-12-23 09:29:15,893 INFO L226 Difference]: Without dead ends: 5231 [2020-12-23 09:29:15,901 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:29:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5231 states. [2020-12-23 09:29:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5231 to 3507. [2020-12-23 09:29:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3507 states. [2020-12-23 09:29:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 5247 transitions. [2020-12-23 09:29:16,135 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 5247 transitions. Word has length 62 [2020-12-23 09:29:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:16,136 INFO L481 AbstractCegarLoop]: Abstraction has 3507 states and 5247 transitions. [2020-12-23 09:29:16,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 5247 transitions. [2020-12-23 09:29:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-23 09:29:16,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:16,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:16,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:29:16,141 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:16,142 INFO L82 PathProgramCache]: Analyzing trace with hash 66248594, now seen corresponding path program 1 times [2020-12-23 09:29:16,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:16,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805695248] [2020-12-23 09:29:16,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:16,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:29:16,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805695248] [2020-12-23 09:29:16,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:16,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:29:16,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810843985] [2020-12-23 09:29:16,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:29:16,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:16,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:29:16,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:16,240 INFO L87 Difference]: Start difference. First operand 3507 states and 5247 transitions. Second operand 6 states. [2020-12-23 09:29:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:17,498 INFO L93 Difference]: Finished difference Result 16565 states and 24575 transitions. [2020-12-23 09:29:17,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 09:29:17,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2020-12-23 09:29:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:17,534 INFO L225 Difference]: With dead ends: 16565 [2020-12-23 09:29:17,534 INFO L226 Difference]: Without dead ends: 13277 [2020-12-23 09:29:17,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-12-23 09:29:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2020-12-23 09:29:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 4373. [2020-12-23 09:29:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4373 states. [2020-12-23 09:29:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 6505 transitions. [2020-12-23 09:29:17,915 INFO L78 Accepts]: Start accepts. Automaton has 4373 states and 6505 transitions. Word has length 64 [2020-12-23 09:29:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:17,915 INFO L481 AbstractCegarLoop]: Abstraction has 4373 states and 6505 transitions. [2020-12-23 09:29:17,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:29:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4373 states and 6505 transitions. [2020-12-23 09:29:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 09:29:17,917 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:17,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:17,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:29:17,918 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash -557616202, now seen corresponding path program 1 times [2020-12-23 09:29:17,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:17,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356772385] [2020-12-23 09:29:17,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:18,009 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:29:18,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356772385] [2020-12-23 09:29:18,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:18,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:29:18,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553665392] [2020-12-23 09:29:18,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:29:18,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:18,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:29:18,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:29:18,012 INFO L87 Difference]: Start difference. First operand 4373 states and 6505 transitions. Second operand 7 states. [2020-12-23 09:29:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:20,085 INFO L93 Difference]: Finished difference Result 30063 states and 44410 transitions. [2020-12-23 09:29:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-23 09:29:20,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2020-12-23 09:29:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:20,152 INFO L225 Difference]: With dead ends: 30063 [2020-12-23 09:29:20,152 INFO L226 Difference]: Without dead ends: 25909 [2020-12-23 09:29:20,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2020-12-23 09:29:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25909 states. [2020-12-23 09:29:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25909 to 4681. [2020-12-23 09:29:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4681 states. [2020-12-23 09:29:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 6915 transitions. [2020-12-23 09:29:20,804 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 6915 transitions. Word has length 65 [2020-12-23 09:29:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:20,804 INFO L481 AbstractCegarLoop]: Abstraction has 4681 states and 6915 transitions. [2020-12-23 09:29:20,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:29:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 6915 transitions. [2020-12-23 09:29:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 09:29:20,813 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:20,813 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:29:20,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:29:20,814 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:20,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1917613388, now seen corresponding path program 1 times [2020-12-23 09:29:20,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:20,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186936524] [2020-12-23 09:29:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:20,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186936524] [2020-12-23 09:29:20,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:20,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:20,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411514495] [2020-12-23 09:29:20,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:20,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:20,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:20,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:20,875 INFO L87 Difference]: Start difference. First operand 4681 states and 6915 transitions. Second operand 3 states. [2020-12-23 09:29:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:21,265 INFO L93 Difference]: Finished difference Result 9872 states and 14556 transitions. [2020-12-23 09:29:21,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:21,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-12-23 09:29:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:21,279 INFO L225 Difference]: With dead ends: 9872 [2020-12-23 09:29:21,279 INFO L226 Difference]: Without dead ends: 5212 [2020-12-23 09:29:21,287 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:29:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2020-12-23 09:29:21,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 5138. [2020-12-23 09:29:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5138 states. [2020-12-23 09:29:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5138 states to 5138 states and 7568 transitions. [2020-12-23 09:29:21,725 INFO L78 Accepts]: Start accepts. Automaton has 5138 states and 7568 transitions. Word has length 77 [2020-12-23 09:29:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:21,725 INFO L481 AbstractCegarLoop]: Abstraction has 5138 states and 7568 transitions. [2020-12-23 09:29:21,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5138 states and 7568 transitions. [2020-12-23 09:29:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 09:29:21,728 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:21,729 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:21,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:29:21,729 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:21,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1623922119, now seen corresponding path program 1 times [2020-12-23 09:29:21,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:21,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823014368] [2020-12-23 09:29:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:21,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823014368] [2020-12-23 09:29:21,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:21,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:29:21,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055807439] [2020-12-23 09:29:21,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:29:21,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:21,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:29:21,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:21,771 INFO L87 Difference]: Start difference. First operand 5138 states and 7568 transitions. Second operand 4 states. [2020-12-23 09:29:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:22,707 INFO L93 Difference]: Finished difference Result 13746 states and 20084 transitions. [2020-12-23 09:29:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:29:22,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 09:29:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:22,730 INFO L225 Difference]: With dead ends: 13746 [2020-12-23 09:29:22,730 INFO L226 Difference]: Without dead ends: 8508 [2020-12-23 09:29:22,745 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:29:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2020-12-23 09:29:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 7573. [2020-12-23 09:29:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2020-12-23 09:29:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 10928 transitions. [2020-12-23 09:29:23,508 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 10928 transitions. Word has length 88 [2020-12-23 09:29:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:23,508 INFO L481 AbstractCegarLoop]: Abstraction has 7573 states and 10928 transitions. [2020-12-23 09:29:23,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:29:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 10928 transitions. [2020-12-23 09:29:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 09:29:23,511 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:23,512 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-12-23 09:29:23,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:29:23,512 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:23,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:23,514 INFO L82 PathProgramCache]: Analyzing trace with hash 510402257, now seen corresponding path program 1 times [2020-12-23 09:29:23,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:23,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907373190] [2020-12-23 09:29:23,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:23,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907373190] [2020-12-23 09:29:23,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:23,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:23,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067295500] [2020-12-23 09:29:23,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:23,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:23,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:23,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:23,568 INFO L87 Difference]: Start difference. First operand 7573 states and 10928 transitions. Second operand 3 states. [2020-12-23 09:29:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:23,818 INFO L93 Difference]: Finished difference Result 10916 states and 15781 transitions. [2020-12-23 09:29:23,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:23,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-12-23 09:29:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:23,826 INFO L225 Difference]: With dead ends: 10916 [2020-12-23 09:29:23,827 INFO L226 Difference]: Without dead ends: 3351 [2020-12-23 09:29:23,835 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:29:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2020-12-23 09:29:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3298. [2020-12-23 09:29:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3298 states. [2020-12-23 09:29:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 4457 transitions. [2020-12-23 09:29:24,070 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 4457 transitions. Word has length 95 [2020-12-23 09:29:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:24,070 INFO L481 AbstractCegarLoop]: Abstraction has 3298 states and 4457 transitions. [2020-12-23 09:29:24,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 4457 transitions. [2020-12-23 09:29:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 09:29:24,072 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:24,072 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:29:24,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:29:24,072 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1852409954, now seen corresponding path program 1 times [2020-12-23 09:29:24,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:24,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293965145] [2020-12-23 09:29:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:24,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293965145] [2020-12-23 09:29:24,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:24,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:29:24,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150922623] [2020-12-23 09:29:24,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:29:24,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:24,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:29:24,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:29:24,123 INFO L87 Difference]: Start difference. First operand 3298 states and 4457 transitions. Second operand 5 states. [2020-12-23 09:29:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:25,258 INFO L93 Difference]: Finished difference Result 12573 states and 16987 transitions. [2020-12-23 09:29:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:29:25,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-23 09:29:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:25,281 INFO L225 Difference]: With dead ends: 12573 [2020-12-23 09:29:25,281 INFO L226 Difference]: Without dead ends: 9449 [2020-12-23 09:29:25,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:29:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9449 states. [2020-12-23 09:29:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9449 to 3300. [2020-12-23 09:29:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3300 states. [2020-12-23 09:29:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4453 transitions. [2020-12-23 09:29:25,622 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4453 transitions. Word has length 98 [2020-12-23 09:29:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:25,622 INFO L481 AbstractCegarLoop]: Abstraction has 3300 states and 4453 transitions. [2020-12-23 09:29:25,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:29:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4453 transitions. [2020-12-23 09:29:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:29:25,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:25,624 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:29:25,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:29:25,625 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:25,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1180801181, now seen corresponding path program 1 times [2020-12-23 09:29:25,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:25,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630434994] [2020-12-23 09:29:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:25,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630434994] [2020-12-23 09:29:25,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130364943] [2020-12-23 09:29:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:25,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:29:25,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:25,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:29:25,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-23 09:29:25,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866093161] [2020-12-23 09:29:25,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:25,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:25,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:25,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:25,981 INFO L87 Difference]: Start difference. First operand 3300 states and 4453 transitions. Second operand 3 states. [2020-12-23 09:29:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:26,404 INFO L93 Difference]: Finished difference Result 3939 states and 5308 transitions. [2020-12-23 09:29:26,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:26,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 09:29:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:26,413 INFO L225 Difference]: With dead ends: 3939 [2020-12-23 09:29:26,414 INFO L226 Difference]: Without dead ends: 3935 [2020-12-23 09:29:26,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3935 states. [2020-12-23 09:29:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3935 to 3885. [2020-12-23 09:29:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2020-12-23 09:29:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 5232 transitions. [2020-12-23 09:29:26,781 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 5232 transitions. Word has length 100 [2020-12-23 09:29:26,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:26,781 INFO L481 AbstractCegarLoop]: Abstraction has 3885 states and 5232 transitions. [2020-12-23 09:29:26,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5232 transitions. [2020-12-23 09:29:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-12-23 09:29:26,785 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:26,785 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:26,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 09:29:26,999 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:27,000 INFO L82 PathProgramCache]: Analyzing trace with hash -411629455, now seen corresponding path program 1 times [2020-12-23 09:29:27,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:27,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412205064] [2020-12-23 09:29:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:27,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412205064] [2020-12-23 09:29:27,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928364771] [2020-12-23 09:29:27,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:27,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:29:27,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:27,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:29:27,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-23 09:29:27,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229238254] [2020-12-23 09:29:27,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:27,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:27,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:27,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:27,429 INFO L87 Difference]: Start difference. First operand 3885 states and 5232 transitions. Second operand 3 states. [2020-12-23 09:29:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:27,696 INFO L93 Difference]: Finished difference Result 6919 states and 9369 transitions. [2020-12-23 09:29:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:27,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2020-12-23 09:29:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:27,703 INFO L225 Difference]: With dead ends: 6919 [2020-12-23 09:29:27,704 INFO L226 Difference]: Without dead ends: 3043 [2020-12-23 09:29:27,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2020-12-23 09:29:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2822. [2020-12-23 09:29:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-12-23 09:29:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 3744 transitions. [2020-12-23 09:29:27,986 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 3744 transitions. Word has length 155 [2020-12-23 09:29:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:27,986 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 3744 transitions. [2020-12-23 09:29:27,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3744 transitions. [2020-12-23 09:29:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-12-23 09:29:27,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:27,990 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:28,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 09:29:28,205 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:28,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:28,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1795907654, now seen corresponding path program 1 times [2020-12-23 09:29:28,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:28,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356130551] [2020-12-23 09:29:28,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:28,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356130551] [2020-12-23 09:29:28,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534430266] [2020-12-23 09:29:28,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:29:28,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 09:29:28,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:29:28,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-23 09:29:28,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391329482] [2020-12-23 09:29:28,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:28,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:28,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:28,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:28,552 INFO L87 Difference]: Start difference. First operand 2822 states and 3744 transitions. Second operand 3 states. [2020-12-23 09:29:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:28,856 INFO L93 Difference]: Finished difference Result 5475 states and 7304 transitions. [2020-12-23 09:29:28,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:28,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2020-12-23 09:29:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:28,862 INFO L225 Difference]: With dead ends: 5475 [2020-12-23 09:29:28,863 INFO L226 Difference]: Without dead ends: 2822 [2020-12-23 09:29:28,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2020-12-23 09:29:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2822. [2020-12-23 09:29:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-12-23 09:29:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 3648 transitions. [2020-12-23 09:29:29,225 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 3648 transitions. Word has length 158 [2020-12-23 09:29:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:29,226 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 3648 transitions. [2020-12-23 09:29:29,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3648 transitions. [2020-12-23 09:29:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 09:29:29,229 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:29,229 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:29,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 09:29:29,443 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:29,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:29,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1353529397, now seen corresponding path program 1 times [2020-12-23 09:29:29,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:29,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765652976] [2020-12-23 09:29:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:29,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765652976] [2020-12-23 09:29:29,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712725792] [2020-12-23 09:29:29,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:29,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:29:29,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 09:29:29,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:29:29,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-23 09:29:29,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385499759] [2020-12-23 09:29:29,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:29,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:29,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:29,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:29,817 INFO L87 Difference]: Start difference. First operand 2822 states and 3648 transitions. Second operand 3 states. [2020-12-23 09:29:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:30,506 INFO L93 Difference]: Finished difference Result 6382 states and 8413 transitions. [2020-12-23 09:29:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:30,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2020-12-23 09:29:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:30,514 INFO L225 Difference]: With dead ends: 6382 [2020-12-23 09:29:30,514 INFO L226 Difference]: Without dead ends: 3729 [2020-12-23 09:29:30,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2020-12-23 09:29:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3638. [2020-12-23 09:29:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3638 states. [2020-12-23 09:29:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 4593 transitions. [2020-12-23 09:29:30,915 INFO L78 Accepts]: Start accepts. Automaton has 3638 states and 4593 transitions. Word has length 159 [2020-12-23 09:29:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:30,916 INFO L481 AbstractCegarLoop]: Abstraction has 3638 states and 4593 transitions. [2020-12-23 09:29:30,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 4593 transitions. [2020-12-23 09:29:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-23 09:29:30,922 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:30,922 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:31,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:31,137 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:31,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:31,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1696904249, now seen corresponding path program 1 times [2020-12-23 09:29:31,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:31,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406427973] [2020-12-23 09:29:31,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:31,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406427973] [2020-12-23 09:29:31,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824712393] [2020-12-23 09:29:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:31,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 09:29:31,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:31,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:31,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-12-23 09:29:31,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840268418] [2020-12-23 09:29:31,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:29:31,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:31,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:29:31,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:29:31,770 INFO L87 Difference]: Start difference. First operand 3638 states and 4593 transitions. Second operand 9 states. [2020-12-23 09:29:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:34,176 INFO L93 Difference]: Finished difference Result 18266 states and 23153 transitions. [2020-12-23 09:29:34,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-23 09:29:34,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2020-12-23 09:29:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:34,205 INFO L225 Difference]: With dead ends: 18266 [2020-12-23 09:29:34,206 INFO L226 Difference]: Without dead ends: 14797 [2020-12-23 09:29:34,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 09:29:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14797 states. [2020-12-23 09:29:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14797 to 5157. [2020-12-23 09:29:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5157 states. [2020-12-23 09:29:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5157 states to 5157 states and 6540 transitions. [2020-12-23 09:29:34,987 INFO L78 Accepts]: Start accepts. Automaton has 5157 states and 6540 transitions. Word has length 161 [2020-12-23 09:29:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:34,988 INFO L481 AbstractCegarLoop]: Abstraction has 5157 states and 6540 transitions. [2020-12-23 09:29:34,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:29:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5157 states and 6540 transitions. [2020-12-23 09:29:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2020-12-23 09:29:34,993 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:34,993 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:35,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:35,209 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:35,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1534496844, now seen corresponding path program 1 times [2020-12-23 09:29:35,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:35,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907452232] [2020-12-23 09:29:35,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:29:35,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907452232] [2020-12-23 09:29:35,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404137879] [2020-12-23 09:29:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:35,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-23 09:29:35,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:29:36,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:36,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-12-23 09:29:36,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383568491] [2020-12-23 09:29:36,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:29:36,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:29:36,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:29:36,086 INFO L87 Difference]: Start difference. First operand 5157 states and 6540 transitions. Second operand 11 states. [2020-12-23 09:29:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:38,793 INFO L93 Difference]: Finished difference Result 23793 states and 30067 transitions. [2020-12-23 09:29:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-12-23 09:29:38,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 259 [2020-12-23 09:29:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:38,816 INFO L225 Difference]: With dead ends: 23793 [2020-12-23 09:29:38,817 INFO L226 Difference]: Without dead ends: 18805 [2020-12-23 09:29:38,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 277 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1631, Unknown=0, NotChecked=0, Total=1892 [2020-12-23 09:29:38,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18805 states. [2020-12-23 09:29:39,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18805 to 6553. [2020-12-23 09:29:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6553 states. [2020-12-23 09:29:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 8320 transitions. [2020-12-23 09:29:39,683 INFO L78 Accepts]: Start accepts. Automaton has 6553 states and 8320 transitions. Word has length 259 [2020-12-23 09:29:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:39,684 INFO L481 AbstractCegarLoop]: Abstraction has 6553 states and 8320 transitions. [2020-12-23 09:29:39,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:29:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6553 states and 8320 transitions. [2020-12-23 09:29:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2020-12-23 09:29:39,692 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:39,692 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 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:29:39,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:39,906 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:39,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:39,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2121178541, now seen corresponding path program 1 times [2020-12-23 09:29:39,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:39,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692439828] [2020-12-23 09:29:39,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 15 proven. 448 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 09:29:40,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692439828] [2020-12-23 09:29:40,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320878583] [2020-12-23 09:29:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:40,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-23 09:29:40,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 15 proven. 448 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 09:29:40,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:40,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2020-12-23 09:29:40,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199199317] [2020-12-23 09:29:40,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 09:29:40,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:40,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 09:29:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:29:40,911 INFO L87 Difference]: Start difference. First operand 6553 states and 8320 transitions. Second operand 13 states. [2020-12-23 09:29:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:44,856 INFO L93 Difference]: Finished difference Result 29399 states and 37094 transitions. [2020-12-23 09:29:44,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-12-23 09:29:44,859 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 358 [2020-12-23 09:29:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:44,884 INFO L225 Difference]: With dead ends: 29399 [2020-12-23 09:29:44,884 INFO L226 Difference]: Without dead ends: 23015 [2020-12-23 09:29:44,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 380 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=2655, Unknown=0, NotChecked=0, Total=2970 [2020-12-23 09:29:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23015 states. [2020-12-23 09:29:45,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23015 to 7951. [2020-12-23 09:29:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7951 states. [2020-12-23 09:29:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7951 states to 7951 states and 10102 transitions. [2020-12-23 09:29:45,864 INFO L78 Accepts]: Start accepts. Automaton has 7951 states and 10102 transitions. Word has length 358 [2020-12-23 09:29:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:45,865 INFO L481 AbstractCegarLoop]: Abstraction has 7951 states and 10102 transitions. [2020-12-23 09:29:45,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 09:29:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 7951 states and 10102 transitions. [2020-12-23 09:29:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2020-12-23 09:29:45,869 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:45,869 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:46,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:46,085 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:46,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1147875523, now seen corresponding path program 1 times [2020-12-23 09:29:46,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:46,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688601161] [2020-12-23 09:29:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 533 proven. 299 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 09:29:46,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688601161] [2020-12-23 09:29:46,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863167633] [2020-12-23 09:29:46,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 09:29:46,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 09:29:47,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:29:47,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 13 [2020-12-23 09:29:47,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114806372] [2020-12-23 09:29:47,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:29:47,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:47,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:29:47,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:29:47,170 INFO L87 Difference]: Start difference. First operand 7951 states and 10102 transitions. Second operand 11 states. [2020-12-23 09:29:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:48,918 INFO L93 Difference]: Finished difference Result 18380 states and 23261 transitions. [2020-12-23 09:29:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 09:29:48,918 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 458 [2020-12-23 09:29:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:48,933 INFO L225 Difference]: With dead ends: 18380 [2020-12-23 09:29:48,933 INFO L226 Difference]: Without dead ends: 10595 [2020-12-23 09:29:48,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2020-12-23 09:29:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10595 states. [2020-12-23 09:29:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10595 to 7821. [2020-12-23 09:29:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7821 states. [2020-12-23 09:29:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7821 states to 7821 states and 9927 transitions. [2020-12-23 09:29:49,777 INFO L78 Accepts]: Start accepts. Automaton has 7821 states and 9927 transitions. Word has length 458 [2020-12-23 09:29:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:49,777 INFO L481 AbstractCegarLoop]: Abstraction has 7821 states and 9927 transitions. [2020-12-23 09:29:49,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:29:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 7821 states and 9927 transitions. [2020-12-23 09:29:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2020-12-23 09:29:49,781 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:49,782 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:49,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 09:29:49,983 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:49,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:49,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1350675601, now seen corresponding path program 1 times [2020-12-23 09:29:49,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:49,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212307568] [2020-12-23 09:29:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2020-12-23 09:29:50,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212307568] [2020-12-23 09:29:50,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:50,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:50,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690892370] [2020-12-23 09:29:50,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:50,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:50,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:50,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:50,210 INFO L87 Difference]: Start difference. First operand 7821 states and 9927 transitions. Second operand 3 states. [2020-12-23 09:29:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:50,495 INFO L93 Difference]: Finished difference Result 9446 states and 11784 transitions. [2020-12-23 09:29:50,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:50,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 459 [2020-12-23 09:29:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:50,498 INFO L225 Difference]: With dead ends: 9446 [2020-12-23 09:29:50,498 INFO L226 Difference]: Without dead ends: 1680 [2020-12-23 09:29:50,502 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:29:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2020-12-23 09:29:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1677. [2020-12-23 09:29:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2020-12-23 09:29:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 1844 transitions. [2020-12-23 09:29:50,668 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 1844 transitions. Word has length 459 [2020-12-23 09:29:50,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:50,668 INFO L481 AbstractCegarLoop]: Abstraction has 1677 states and 1844 transitions. [2020-12-23 09:29:50,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 1844 transitions. [2020-12-23 09:29:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2020-12-23 09:29:50,672 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:50,673 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:50,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:29:50,673 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2094133201, now seen corresponding path program 1 times [2020-12-23 09:29:50,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:50,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307752396] [2020-12-23 09:29:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2020-12-23 09:29:51,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307752396] [2020-12-23 09:29:51,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:51,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:29:51,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753798014] [2020-12-23 09:29:51,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:29:51,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:51,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:29:51,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:29:51,025 INFO L87 Difference]: Start difference. First operand 1677 states and 1844 transitions. Second operand 7 states. [2020-12-23 09:29:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:51,605 INFO L93 Difference]: Finished difference Result 3436 states and 3801 transitions. [2020-12-23 09:29:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 09:29:51,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 460 [2020-12-23 09:29:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:51,610 INFO L225 Difference]: With dead ends: 3436 [2020-12-23 09:29:51,610 INFO L226 Difference]: Without dead ends: 2729 [2020-12-23 09:29:51,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:29:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2020-12-23 09:29:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 1671. [2020-12-23 09:29:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2020-12-23 09:29:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1830 transitions. [2020-12-23 09:29:51,885 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1830 transitions. Word has length 460 [2020-12-23 09:29:51,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:51,886 INFO L481 AbstractCegarLoop]: Abstraction has 1671 states and 1830 transitions. [2020-12-23 09:29:51,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:29:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1830 transitions. [2020-12-23 09:29:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2020-12-23 09:29:51,890 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:51,890 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:51,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:29:51,891 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1190024889, now seen corresponding path program 1 times [2020-12-23 09:29:51,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:51,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083192406] [2020-12-23 09:29:51,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2020-12-23 09:29:52,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083192406] [2020-12-23 09:29:52,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:52,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:29:52,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984915188] [2020-12-23 09:29:52,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:29:52,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:52,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:29:52,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:29:52,141 INFO L87 Difference]: Start difference. First operand 1671 states and 1830 transitions. Second operand 5 states. [2020-12-23 09:29:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:52,420 INFO L93 Difference]: Finished difference Result 2818 states and 3106 transitions. [2020-12-23 09:29:52,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 09:29:52,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 461 [2020-12-23 09:29:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:52,424 INFO L225 Difference]: With dead ends: 2818 [2020-12-23 09:29:52,424 INFO L226 Difference]: Without dead ends: 2109 [2020-12-23 09:29:52,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:29:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2020-12-23 09:29:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1621. [2020-12-23 09:29:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2020-12-23 09:29:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1733 transitions. [2020-12-23 09:29:52,656 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1733 transitions. Word has length 461 [2020-12-23 09:29:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:52,656 INFO L481 AbstractCegarLoop]: Abstraction has 1621 states and 1733 transitions. [2020-12-23 09:29:52,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:29:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1733 transitions. [2020-12-23 09:29:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2020-12-23 09:29:52,661 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:52,661 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:52,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:29:52,661 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:52,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:52,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1565931232, now seen corresponding path program 1 times [2020-12-23 09:29:52,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:52,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302472978] [2020-12-23 09:29:52,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 91 proven. 308 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2020-12-23 09:29:53,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302472978] [2020-12-23 09:29:53,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167087804] [2020-12-23 09:29:53,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-23 09:29:53,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 93 proven. 255 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2020-12-23 09:29:54,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:54,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 23 [2020-12-23 09:29:54,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220139331] [2020-12-23 09:29:54,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-23 09:29:54,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:54,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-23 09:29:54,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2020-12-23 09:29:54,473 INFO L87 Difference]: Start difference. First operand 1621 states and 1733 transitions. Second operand 23 states. [2020-12-23 09:29:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:55,525 INFO L93 Difference]: Finished difference Result 1935 states and 2071 transitions. [2020-12-23 09:29:55,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-23 09:29:55,525 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 517 [2020-12-23 09:29:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:55,527 INFO L225 Difference]: With dead ends: 1935 [2020-12-23 09:29:55,529 INFO L226 Difference]: Without dead ends: 1933 [2020-12-23 09:29:55,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 521 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2020-12-23 09:29:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2020-12-23 09:29:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1621. [2020-12-23 09:29:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2020-12-23 09:29:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1732 transitions. [2020-12-23 09:29:55,710 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1732 transitions. Word has length 517 [2020-12-23 09:29:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:55,711 INFO L481 AbstractCegarLoop]: Abstraction has 1621 states and 1732 transitions. [2020-12-23 09:29:55,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-23 09:29:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1732 transitions. [2020-12-23 09:29:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2020-12-23 09:29:55,714 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:55,715 INFO L422 BasicCegarLoop]: trace histogram [11, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 09:29:55,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-23 09:29:55,927 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:55,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash 870653210, now seen corresponding path program 1 times [2020-12-23 09:29:55,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:55,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843702399] [2020-12-23 09:29:55,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 269 proven. 47 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2020-12-23 09:29:56,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843702399] [2020-12-23 09:29:56,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439511247] [2020-12-23 09:29:56,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:56,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 1594 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 09:29:56,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 269 proven. 47 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2020-12-23 09:29:57,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:57,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-12-23 09:29:57,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474797869] [2020-12-23 09:29:57,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:29:57,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:57,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:29:57,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:29:57,269 INFO L87 Difference]: Start difference. First operand 1621 states and 1732 transitions. Second operand 9 states. [2020-12-23 09:29:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:57,848 INFO L93 Difference]: Finished difference Result 2619 states and 2802 transitions. [2020-12-23 09:29:57,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 09:29:57,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 565 [2020-12-23 09:29:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:57,851 INFO L225 Difference]: With dead ends: 2619 [2020-12-23 09:29:57,852 INFO L226 Difference]: Without dead ends: 2139 [2020-12-23 09:29:57,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 573 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:29:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2020-12-23 09:29:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1617. [2020-12-23 09:29:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2020-12-23 09:29:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 1720 transitions. [2020-12-23 09:29:58,055 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 1720 transitions. Word has length 565 [2020-12-23 09:29:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:58,055 INFO L481 AbstractCegarLoop]: Abstraction has 1617 states and 1720 transitions. [2020-12-23 09:29:58,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:29:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1720 transitions. [2020-12-23 09:29:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2020-12-23 09:29:58,061 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:58,061 INFO L422 BasicCegarLoop]: trace histogram [12, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 09:29:58,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-12-23 09:29:58,275 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:58,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:58,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2114825569, now seen corresponding path program 1 times [2020-12-23 09:29:58,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:58,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501736242] [2020-12-23 09:29:58,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 172 proven. 774 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2020-12-23 09:29:59,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501736242] [2020-12-23 09:29:59,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924538838] [2020-12-23 09:29:59,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:59,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 1734 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-23 09:29:59,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 234 proven. 676 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2020-12-23 09:30:00,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:00,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 32 [2020-12-23 09:30:00,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677735183] [2020-12-23 09:30:00,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-23 09:30:00,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:00,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-23 09:30:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2020-12-23 09:30:00,836 INFO L87 Difference]: Start difference. First operand 1617 states and 1720 transitions. Second operand 32 states. [2020-12-23 09:30:02,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:02,327 INFO L93 Difference]: Finished difference Result 1863 states and 1983 transitions. [2020-12-23 09:30:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-12-23 09:30:02,327 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 623 [2020-12-23 09:30:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:02,329 INFO L225 Difference]: With dead ends: 1863 [2020-12-23 09:30:02,329 INFO L226 Difference]: Without dead ends: 1861 [2020-12-23 09:30:02,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 625 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=3347, Unknown=0, NotChecked=0, Total=3782 [2020-12-23 09:30:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2020-12-23 09:30:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1617. [2020-12-23 09:30:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2020-12-23 09:30:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 1719 transitions. [2020-12-23 09:30:02,556 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 1719 transitions. Word has length 623 [2020-12-23 09:30:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:02,556 INFO L481 AbstractCegarLoop]: Abstraction has 1617 states and 1719 transitions. [2020-12-23 09:30:02,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-23 09:30:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1719 transitions. [2020-12-23 09:30:02,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2020-12-23 09:30:02,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:02,563 INFO L422 BasicCegarLoop]: trace histogram [13, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:02,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-23 09:30:02,764 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:02,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:02,765 INFO L82 PathProgramCache]: Analyzing trace with hash -874836839, now seen corresponding path program 1 times [2020-12-23 09:30:02,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:02,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627529288] [2020-12-23 09:30:02,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 454 proven. 208 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2020-12-23 09:30:03,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627529288] [2020-12-23 09:30:03,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657580547] [2020-12-23 09:30:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:03,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 1861 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-23 09:30:03,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 454 proven. 208 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2020-12-23 09:30:04,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:04,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-12-23 09:30:04,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052283635] [2020-12-23 09:30:04,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:30:04,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:04,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:30:04,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:30:04,496 INFO L87 Difference]: Start difference. First operand 1617 states and 1719 transitions. Second operand 11 states. [2020-12-23 09:30:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:05,193 INFO L93 Difference]: Finished difference Result 2259 states and 2407 transitions. [2020-12-23 09:30:05,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 09:30:05,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 671 [2020-12-23 09:30:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:05,197 INFO L225 Difference]: With dead ends: 2259 [2020-12-23 09:30:05,197 INFO L226 Difference]: Without dead ends: 1968 [2020-12-23 09:30:05,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 682 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2020-12-23 09:30:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2020-12-23 09:30:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1615. [2020-12-23 09:30:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2020-12-23 09:30:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 1709 transitions. [2020-12-23 09:30:05,419 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 1709 transitions. Word has length 671 [2020-12-23 09:30:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:05,420 INFO L481 AbstractCegarLoop]: Abstraction has 1615 states and 1709 transitions. [2020-12-23 09:30:05,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:30:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1709 transitions. [2020-12-23 09:30:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2020-12-23 09:30:05,425 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:05,426 INFO L422 BasicCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:05,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:05,633 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:05,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1205159151, now seen corresponding path program 1 times [2020-12-23 09:30:05,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:05,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903231] [2020-12-23 09:30:05,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 131 proven. 1372 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-12-23 09:30:07,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903231] [2020-12-23 09:30:07,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277426458] [2020-12-23 09:30:07,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:07,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 2002 conjuncts, 57 conjunts are in the unsatisfiable core [2020-12-23 09:30:07,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 287 proven. 1198 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-12-23 09:30:09,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:09,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 38 [2020-12-23 09:30:09,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435221372] [2020-12-23 09:30:09,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-12-23 09:30:09,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:09,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-12-23 09:30:09,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1306, Unknown=0, NotChecked=0, Total=1406 [2020-12-23 09:30:09,042 INFO L87 Difference]: Start difference. First operand 1615 states and 1709 transitions. Second operand 38 states. [2020-12-23 09:30:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:10,946 INFO L93 Difference]: Finished difference Result 1871 states and 1982 transitions. [2020-12-23 09:30:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-12-23 09:30:10,947 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 730 [2020-12-23 09:30:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:10,950 INFO L225 Difference]: With dead ends: 1871 [2020-12-23 09:30:10,950 INFO L226 Difference]: Without dead ends: 1869 [2020-12-23 09:30:10,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 734 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=498, Invalid=4758, Unknown=0, NotChecked=0, Total=5256 [2020-12-23 09:30:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2020-12-23 09:30:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1615. [2020-12-23 09:30:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2020-12-23 09:30:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 1708 transitions. [2020-12-23 09:30:11,160 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 1708 transitions. Word has length 730 [2020-12-23 09:30:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:11,161 INFO L481 AbstractCegarLoop]: Abstraction has 1615 states and 1708 transitions. [2020-12-23 09:30:11,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-12-23 09:30:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1708 transitions. [2020-12-23 09:30:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2020-12-23 09:30:11,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:11,166 INFO L422 BasicCegarLoop]: trace histogram [15, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:11,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2020-12-23 09:30:11,381 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:11,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1676282123, now seen corresponding path program 1 times [2020-12-23 09:30:11,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:11,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426425047] [2020-12-23 09:30:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 639 proven. 484 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2020-12-23 09:30:12,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426425047] [2020-12-23 09:30:12,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052593662] [2020-12-23 09:30:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:12,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 2129 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-23 09:30:12,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 639 proven. 484 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2020-12-23 09:30:13,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:13,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2020-12-23 09:30:13,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746551880] [2020-12-23 09:30:13,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 09:30:13,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:13,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 09:30:13,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:30:13,779 INFO L87 Difference]: Start difference. First operand 1615 states and 1708 transitions. Second operand 13 states. [2020-12-23 09:30:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:14,619 INFO L93 Difference]: Finished difference Result 1976 states and 2098 transitions. [2020-12-23 09:30:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-23 09:30:14,619 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 778 [2020-12-23 09:30:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:14,623 INFO L225 Difference]: With dead ends: 1976 [2020-12-23 09:30:14,623 INFO L226 Difference]: Without dead ends: 1874 [2020-12-23 09:30:14,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 791 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2020-12-23 09:30:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2020-12-23 09:30:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1613. [2020-12-23 09:30:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2020-12-23 09:30:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 1699 transitions. [2020-12-23 09:30:14,847 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 1699 transitions. Word has length 778 [2020-12-23 09:30:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:14,848 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 1699 transitions. [2020-12-23 09:30:14,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 09:30:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 1699 transitions. [2020-12-23 09:30:14,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2020-12-23 09:30:14,854 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:14,854 INFO L422 BasicCegarLoop]: trace histogram [16, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:15,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:15,055 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash 771452747, now seen corresponding path program 1 times [2020-12-23 09:30:15,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:15,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291032268] [2020-12-23 09:30:15,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2093 backedges. 90 proven. 1978 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 09:30:16,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291032268] [2020-12-23 09:30:16,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486611368] [2020-12-23 09:30:16,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:17,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 2271 conjuncts, 69 conjunts are in the unsatisfiable core [2020-12-23 09:30:17,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2093 backedges. 248 proven. 1820 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 09:30:19,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:19,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 44 [2020-12-23 09:30:19,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361174367] [2020-12-23 09:30:19,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-12-23 09:30:19,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:19,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-12-23 09:30:19,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1774, Unknown=0, NotChecked=0, Total=1892 [2020-12-23 09:30:19,458 INFO L87 Difference]: Start difference. First operand 1613 states and 1699 transitions. Second operand 44 states. [2020-12-23 09:30:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:22,479 INFO L93 Difference]: Finished difference Result 1874 states and 1978 transitions. [2020-12-23 09:30:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-12-23 09:30:22,479 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 838 [2020-12-23 09:30:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:22,480 INFO L225 Difference]: With dead ends: 1874 [2020-12-23 09:30:22,480 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 09:30:22,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 849 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1941 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=675, Invalid=7515, Unknown=0, NotChecked=0, Total=8190 [2020-12-23 09:30:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 09:30:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 09:30:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 09:30:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 09:30:22,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 838 [2020-12-23 09:30:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:22,486 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 09:30:22,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-12-23 09:30:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 09:30:22,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 09:30:22,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-12-23 09:30:22,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 09:30:22,878 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 111 [2020-12-23 09:30:23,844 WARN L197 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 128 [2020-12-23 09:30:23,949 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 112 [2020-12-23 09:30:24,400 WARN L197 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 242 [2020-12-23 09:30:24,780 WARN L197 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 204 [2020-12-23 09:30:26,965 WARN L197 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 713 DAG size of output: 568 [2020-12-23 09:30:27,079 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 172 [2020-12-23 09:30:29,835 WARN L197 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 832 DAG size of output: 612 [2020-12-23 09:30:31,538 WARN L197 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 713 DAG size of output: 581 [2020-12-23 09:30:38,545 WARN L197 SmtUtils]: Spent 6.69 s on a formula simplification. DAG size of input: 1605 DAG size of output: 1287 [2020-12-23 09:30:38,720 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 209 [2020-12-23 09:30:39,042 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 276 [2020-12-23 09:30:39,379 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 204 [2020-12-23 09:30:40,603 WARN L197 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 544 DAG size of output: 455 [2020-12-23 09:30:42,447 WARN L197 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 693 DAG size of output: 544 [2020-12-23 09:30:42,643 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 201 [2020-12-23 09:30:44,513 WARN L197 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 709 DAG size of output: 577 [2020-12-23 09:30:46,238 WARN L197 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 713 DAG size of output: 581 [2020-12-23 09:30:46,969 WARN L197 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 451 DAG size of output: 382 [2020-12-23 09:30:47,464 WARN L197 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 350 DAG size of output: 323 [2020-12-23 09:30:49,308 WARN L197 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 693 DAG size of output: 544 [2020-12-23 09:30:49,495 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 183 [2020-12-23 09:30:51,344 WARN L197 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 693 DAG size of output: 544 [2020-12-23 09:30:51,466 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 192 [2020-12-23 09:30:51,606 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 234 [2020-12-23 09:30:52,382 WARN L197 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 489 [2020-12-23 09:30:57,212 WARN L197 SmtUtils]: Spent 4.82 s on a formula simplification. DAG size of input: 1360 DAG size of output: 1093 [2020-12-23 09:30:59,075 WARN L197 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 693 DAG size of output: 544 [2020-12-23 09:31:00,969 WARN L197 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 663 DAG size of output: 522 [2020-12-23 09:31:01,102 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 203 [2020-12-23 09:31:02,915 WARN L197 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 693 DAG size of output: 544 [2020-12-23 09:31:03,116 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 214 [2020-12-23 09:31:03,251 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 213 [2020-12-23 09:31:04,986 WARN L197 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 713 DAG size of output: 581 [2020-12-23 09:31:05,845 WARN L197 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 489 [2020-12-23 09:31:06,487 WARN L197 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 550 DAG size of output: 438 [2020-12-23 09:31:07,219 WARN L197 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 489 [2020-12-23 09:31:07,893 WARN L197 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 550 DAG size of output: 463 [2020-12-23 09:31:08,023 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 203 [2020-12-23 09:31:08,644 WARN L197 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 331 [2020-12-23 09:31:11,520 WARN L197 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 742 DAG size of output: 624 [2020-12-23 09:31:11,741 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 220 [2020-12-23 09:31:13,390 WARN L197 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 713 DAG size of output: 568 [2020-12-23 09:31:13,516 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 190 [2020-12-23 09:31:15,406 WARN L197 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 713 DAG size of output: 568 [2020-12-23 09:31:16,258 WARN L197 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 489 [2020-12-23 09:31:16,463 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 241 [2020-12-23 09:31:16,645 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 204 [2020-12-23 09:31:17,080 WARN L197 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 345 DAG size of output: 316 [2020-12-23 09:31:17,239 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 198 [2020-12-23 09:31:17,995 WARN L197 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 582 DAG size of output: 504 [2020-12-23 09:31:18,223 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 172 [2020-12-23 09:31:18,884 WARN L197 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 489 [2020-12-23 09:31:19,010 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 190 [2020-12-23 09:31:19,236 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 220 [2020-12-23 09:31:19,564 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2020-12-23 09:31:20,584 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 127 DAG size of output: 24 [2020-12-23 09:31:20,960 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2020-12-23 09:31:22,566 WARN L197 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 240 DAG size of output: 125 [2020-12-23 09:31:23,782 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 200 DAG size of output: 121 [2020-12-23 09:31:30,645 WARN L197 SmtUtils]: Spent 6.85 s on a formula simplification. DAG size of input: 544 DAG size of output: 190 [2020-12-23 09:31:31,355 WARN L197 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 123 [2020-12-23 09:31:39,712 WARN L197 SmtUtils]: Spent 8.35 s on a formula simplification. DAG size of input: 588 DAG size of output: 188 [2020-12-23 09:31:46,792 WARN L197 SmtUtils]: Spent 7.07 s on a formula simplification. DAG size of input: 557 DAG size of output: 190 [2020-12-23 09:31:47,566 WARN L197 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 123 [2020-12-23 09:31:48,402 WARN L197 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 122 [2020-12-23 09:31:49,236 WARN L197 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 122 [2020-12-23 09:31:49,568 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2020-12-23 09:31:49,950 WARN L197 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2020-12-23 09:31:50,059 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-12-23 09:32:15,140 WARN L197 SmtUtils]: Spent 25.07 s on a formula simplification. DAG size of input: 1213 DAG size of output: 228 [2020-12-23 09:32:15,496 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2020-12-23 09:32:17,032 WARN L197 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 206 DAG size of output: 125 [2020-12-23 09:32:17,401 WARN L197 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2020-12-23 09:32:17,506 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-12-23 09:32:20,154 WARN L197 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 260 DAG size of output: 131 [2020-12-23 09:32:20,541 WARN L197 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2020-12-23 09:32:20,934 WARN L197 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2020-12-23 09:32:21,689 WARN L197 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 123 [2020-12-23 09:32:22,889 WARN L197 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 200 DAG size of output: 121 [2020-12-23 09:32:28,980 WARN L197 SmtUtils]: Spent 6.08 s on a formula simplification. DAG size of input: 437 DAG size of output: 175 [2020-12-23 09:32:29,736 WARN L197 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 123 [2020-12-23 09:32:35,955 WARN L197 SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 513 DAG size of output: 167 [2020-12-23 09:32:36,698 WARN L197 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 123 [2020-12-23 09:32:38,162 WARN L197 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 197 DAG size of output: 122 [2020-12-23 09:32:45,015 WARN L197 SmtUtils]: Spent 6.85 s on a formula simplification. DAG size of input: 541 DAG size of output: 168 [2020-12-23 09:32:45,129 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2020-12-23 09:32:45,489 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2020-12-23 09:32:45,593 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-12-23 09:32:52,376 WARN L197 SmtUtils]: Spent 6.78 s on a formula simplification. DAG size of input: 557 DAG size of output: 190 [2020-12-23 09:32:52,737 WARN L197 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2020-12-23 09:32:52,841 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-12-23 09:32:56,464 WARN L197 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 375 DAG size of output: 133 [2020-12-23 09:32:58,822 WARN L197 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 307 DAG size of output: 109 [2020-12-23 09:33:04,971 WARN L197 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 513 DAG size of output: 167