/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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 01:58:35,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 01:58:35,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 01:58:35,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 01:58:35,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 01:58:35,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 01:58:35,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 01:58:35,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 01:58:35,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 01:58:35,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 01:58:35,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 01:58:35,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 01:58:35,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 01:58:35,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 01:58:35,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 01:58:35,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 01:58:35,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 01:58:35,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 01:58:35,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 01:58:35,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 01:58:35,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 01:58:35,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 01:58:35,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 01:58:35,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 01:58:35,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 01:58:35,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 01:58:35,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 01:58:35,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 01:58:35,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 01:58:35,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 01:58:35,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 01:58:35,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 01:58:35,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 01:58:35,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 01:58:35,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 01:58:35,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 01:58:35,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 01:58:35,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 01:58:35,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 01:58:35,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 01:58:35,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 01:58:35,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 01:58:35,991 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 01:58:35,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 01:58:35,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 01:58:35,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 01:58:35,996 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 01:58:35,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 01:58:35,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 01:58:35,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 01:58:35,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 01:58:35,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 01:58:35,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 01:58:35,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 01:58:35,998 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 01:58:35,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 01:58:35,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 01:58:35,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 01:58:35,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 01:58:35,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:58:35,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 01:58:35,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 01:58:36,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 01:58:36,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 01:58:36,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 01:58:36,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 01:58:36,000 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 01:58:36,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 01:58:36,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 01:58:36,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 01:58:36,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 01:58:36,416 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 01:58:36,417 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 01:58:36,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i [2021-01-07 01:58:36,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/39fcaa889/0eb1a44d443c4090a0d71fc98d7f00eb/FLAGfb3b38399 [2021-01-07 01:58:37,473 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 01:58:37,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i [2021-01-07 01:58:37,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/39fcaa889/0eb1a44d443c4090a0d71fc98d7f00eb/FLAGfb3b38399 [2021-01-07 01:58:38,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/39fcaa889/0eb1a44d443c4090a0d71fc98d7f00eb [2021-01-07 01:58:38,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 01:58:38,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 01:58:38,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 01:58:38,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 01:58:38,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 01:58:38,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:58:38" (1/1) ... [2021-01-07 01:58:38,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70719be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:38, skipping insertion in model container [2021-01-07 01:58:38,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:58:38" (1/1) ... [2021-01-07 01:58:38,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 01:58:38,139 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~addr_h~0,] left hand side expression in assignment: lhs: VariableLHS[~addr_h~0,] left hand side expression in assignment: lhs: VariableLHS[~addr_l~0,] left hand side expression in assignment: lhs: VariableLHS[~swc_base_addr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~c~1,] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~ident~0,],options] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~ident~0,],firmware_version] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[3]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[4]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[5]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[6]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[7]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[8]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[9]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[10]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[11]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[12]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[13]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[14]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[15]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[16]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[17]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[18]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[19]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[20]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[21]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[IntegerLiteral[22]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~ident~0,],identity],[BinaryExpression[ARITHMOD,IdentifierExpression[~tmp~16,],IntegerLiteral[4294967296]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~uarg~0,],i] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val~0,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~options~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~pc87413_fops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~pc87413_fops_group2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] [2021-01-07 01:58:38,992 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i[115866,115879] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~module_get_succeeded~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] [2021-01-07 01:58:39,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:58:39,072 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] left hand side expression in assignment: lhs: VariableLHS[~cr_data~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~addr_h~0,] left hand side expression in assignment: lhs: VariableLHS[~addr_h~0,] left hand side expression in assignment: lhs: VariableLHS[~addr_l~0,] left hand side expression in assignment: lhs: VariableLHS[~swc_base_addr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~c~1,] left hand side expression in assignment: lhs: VariableLHS[~expect_close~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[13],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[14],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[15],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[17],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[19],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[21],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[22],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[23],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[25],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[26],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[27],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[29],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[30],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ident~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#ident~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~tmp~16,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#uarg~0,],base],StructAccessExpression[IdentifierExpression[~#uarg~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val~0,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~options~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~new_timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~pc87413_fops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~pc87413_fops_group2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] [2021-01-07 01:58:39,353 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i[115866,115879] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~module_get_succeeded~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] [2021-01-07 01:58:39,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:58:39,475 INFO L208 MainTranslator]: Completed translation [2021-01-07 01:58:39,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39 WrapperNode [2021-01-07 01:58:39,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 01:58:39,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 01:58:39,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 01:58:39,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 01:58:39,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39" (1/1) ... [2021-01-07 01:58:39,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39" (1/1) ... [2021-01-07 01:58:39,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 01:58:39,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 01:58:39,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 01:58:39,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 01:58:39,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39" (1/1) ... [2021-01-07 01:58:39,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39" (1/1) ... [2021-01-07 01:58:39,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39" (1/1) ... [2021-01-07 01:58:39,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39" (1/1) ... [2021-01-07 01:58:39,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39" (1/1) ... [2021-01-07 01:58:39,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39" (1/1) ... [2021-01-07 01:58:39,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39" (1/1) ... [2021-01-07 01:58:39,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 01:58:39,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 01:58:39,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 01:58:39,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 01:58:39,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:58:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 01:58:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 01:58:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 01:58:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 01:58:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 01:58:40,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 01:58:40,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 01:58:40,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 01:58:40,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 01:58:40,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 01:58:40,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 01:58:44,775 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 01:58:44,776 INFO L299 CfgBuilder]: Removed 1175 assume(true) statements. [2021-01-07 01:58:44,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:58:44 BoogieIcfgContainer [2021-01-07 01:58:44,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 01:58:44,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 01:58:44,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 01:58:44,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 01:58:44,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 01:58:38" (1/3) ... [2021-01-07 01:58:44,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64472d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:58:44, skipping insertion in model container [2021-01-07 01:58:44,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:58:39" (2/3) ... [2021-01-07 01:58:44,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64472d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:58:44, skipping insertion in model container [2021-01-07 01:58:44,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:58:44" (3/3) ... [2021-01-07 01:58:44,788 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i [2021-01-07 01:58:44,794 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 01:58:44,800 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-07 01:58:44,820 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-07 01:58:44,853 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 01:58:44,853 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 01:58:44,853 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 01:58:44,854 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 01:58:44,854 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 01:58:44,854 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 01:58:44,854 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 01:58:44,854 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 01:58:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states. [2021-01-07 01:58:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 01:58:44,894 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:44,895 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] [2021-01-07 01:58:44,896 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:44,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:44,904 INFO L82 PathProgramCache]: Analyzing trace with hash -292239849, now seen corresponding path program 1 times [2021-01-07 01:58:44,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:44,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935695852] [2021-01-07 01:58:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:58:45,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935695852] [2021-01-07 01:58:45,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:45,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:58:45,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432669989] [2021-01-07 01:58:45,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 01:58:45,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:45,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 01:58:45,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:58:45,426 INFO L87 Difference]: Start difference. First operand 541 states. Second operand 2 states. [2021-01-07 01:58:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:45,518 INFO L93 Difference]: Finished difference Result 1078 states and 1291 transitions. [2021-01-07 01:58:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 01:58:45,520 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 52 [2021-01-07 01:58:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:45,541 INFO L225 Difference]: With dead ends: 1078 [2021-01-07 01:58:45,541 INFO L226 Difference]: Without dead ends: 533 [2021-01-07 01:58:45,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:58:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-01-07 01:58:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2021-01-07 01:58:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2021-01-07 01:58:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 621 transitions. [2021-01-07 01:58:45,643 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 621 transitions. Word has length 52 [2021-01-07 01:58:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:45,644 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 621 transitions. [2021-01-07 01:58:45,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 01:58:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 621 transitions. [2021-01-07 01:58:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 01:58:45,647 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:45,647 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] [2021-01-07 01:58:45,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 01:58:45,648 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1668906015, now seen corresponding path program 1 times [2021-01-07 01:58:45,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:45,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281298390] [2021-01-07 01:58:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:58:45,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281298390] [2021-01-07 01:58:45,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:45,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:58:45,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303247400] [2021-01-07 01:58:45,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:45,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:45,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:45,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:45,974 INFO L87 Difference]: Start difference. First operand 533 states and 621 transitions. Second operand 3 states. [2021-01-07 01:58:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:46,291 INFO L93 Difference]: Finished difference Result 1396 states and 1637 transitions. [2021-01-07 01:58:46,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:46,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2021-01-07 01:58:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:46,301 INFO L225 Difference]: With dead ends: 1396 [2021-01-07 01:58:46,301 INFO L226 Difference]: Without dead ends: 900 [2021-01-07 01:58:46,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:46,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-01-07 01:58:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2021-01-07 01:58:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2021-01-07 01:58:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1056 transitions. [2021-01-07 01:58:46,374 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1056 transitions. Word has length 52 [2021-01-07 01:58:46,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:46,376 INFO L481 AbstractCegarLoop]: Abstraction has 900 states and 1056 transitions. [2021-01-07 01:58:46,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1056 transitions. [2021-01-07 01:58:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 01:58:46,389 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:46,389 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] [2021-01-07 01:58:46,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 01:58:46,390 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:46,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1921366172, now seen corresponding path program 1 times [2021-01-07 01:58:46,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:46,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036492014] [2021-01-07 01:58:46,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:58:46,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036492014] [2021-01-07 01:58:46,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:46,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:58:46,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302748553] [2021-01-07 01:58:46,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:46,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:46,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:46,631 INFO L87 Difference]: Start difference. First operand 900 states and 1056 transitions. Second operand 3 states. [2021-01-07 01:58:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:46,691 INFO L93 Difference]: Finished difference Result 906 states and 1060 transitions. [2021-01-07 01:58:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:46,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-01-07 01:58:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:46,697 INFO L225 Difference]: With dead ends: 906 [2021-01-07 01:58:46,697 INFO L226 Difference]: Without dead ends: 903 [2021-01-07 01:58:46,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2021-01-07 01:58:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 900. [2021-01-07 01:58:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2021-01-07 01:58:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1055 transitions. [2021-01-07 01:58:46,738 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1055 transitions. Word has length 53 [2021-01-07 01:58:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:46,738 INFO L481 AbstractCegarLoop]: Abstraction has 900 states and 1055 transitions. [2021-01-07 01:58:46,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1055 transitions. [2021-01-07 01:58:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 01:58:46,740 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:46,740 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] [2021-01-07 01:58:46,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 01:58:46,741 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:46,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1921425754, now seen corresponding path program 1 times [2021-01-07 01:58:46,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:46,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692461887] [2021-01-07 01:58:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:58:46,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692461887] [2021-01-07 01:58:46,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:46,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:58:46,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909118096] [2021-01-07 01:58:46,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:46,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:46,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:46,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:46,968 INFO L87 Difference]: Start difference. First operand 900 states and 1055 transitions. Second operand 3 states. [2021-01-07 01:58:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:47,046 INFO L93 Difference]: Finished difference Result 1763 states and 2067 transitions. [2021-01-07 01:58:47,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:47,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-01-07 01:58:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:47,056 INFO L225 Difference]: With dead ends: 1763 [2021-01-07 01:58:47,057 INFO L226 Difference]: Without dead ends: 1736 [2021-01-07 01:58:47,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2021-01-07 01:58:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1736. [2021-01-07 01:58:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2021-01-07 01:58:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2038 transitions. [2021-01-07 01:58:47,140 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2038 transitions. Word has length 53 [2021-01-07 01:58:47,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:47,141 INFO L481 AbstractCegarLoop]: Abstraction has 1736 states and 2038 transitions. [2021-01-07 01:58:47,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2038 transitions. [2021-01-07 01:58:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-07 01:58:47,145 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:47,146 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:47,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 01:58:47,146 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash 68796127, now seen corresponding path program 1 times [2021-01-07 01:58:47,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:47,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190674955] [2021-01-07 01:58:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:58:47,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190674955] [2021-01-07 01:58:47,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:47,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:58:47,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925348078] [2021-01-07 01:58:47,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:47,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:47,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:47,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:47,366 INFO L87 Difference]: Start difference. First operand 1736 states and 2038 transitions. Second operand 3 states. [2021-01-07 01:58:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:49,559 INFO L93 Difference]: Finished difference Result 3644 states and 4296 transitions. [2021-01-07 01:58:49,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:49,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-07 01:58:49,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:49,570 INFO L225 Difference]: With dead ends: 3644 [2021-01-07 01:58:49,570 INFO L226 Difference]: Without dead ends: 1945 [2021-01-07 01:58:49,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2021-01-07 01:58:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1914. [2021-01-07 01:58:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2021-01-07 01:58:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2264 transitions. [2021-01-07 01:58:49,664 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2264 transitions. Word has length 100 [2021-01-07 01:58:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:49,666 INFO L481 AbstractCegarLoop]: Abstraction has 1914 states and 2264 transitions. [2021-01-07 01:58:49,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2264 transitions. [2021-01-07 01:58:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-07 01:58:49,677 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:49,677 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:49,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 01:58:49,678 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:49,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:49,678 INFO L82 PathProgramCache]: Analyzing trace with hash -305541512, now seen corresponding path program 1 times [2021-01-07 01:58:49,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:49,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396879988] [2021-01-07 01:58:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:58:49,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396879988] [2021-01-07 01:58:49,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103146945] [2021-01-07 01:58:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:58:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:50,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 1585 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 01:58:50,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:58:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:58:50,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:58:50,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-01-07 01:58:50,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819857081] [2021-01-07 01:58:50,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:58:50,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:50,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:58:50,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:58:50,745 INFO L87 Difference]: Start difference. First operand 1914 states and 2264 transitions. Second operand 4 states. [2021-01-07 01:58:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:51,103 INFO L93 Difference]: Finished difference Result 5647 states and 6683 transitions. [2021-01-07 01:58:51,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:58:51,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2021-01-07 01:58:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:51,132 INFO L225 Difference]: With dead ends: 5647 [2021-01-07 01:58:51,132 INFO L226 Difference]: Without dead ends: 5620 [2021-01-07 01:58:51,135 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:58:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5620 states. [2021-01-07 01:58:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5620 to 5418. [2021-01-07 01:58:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5418 states. [2021-01-07 01:58:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5418 states to 5418 states and 6450 transitions. [2021-01-07 01:58:51,441 INFO L78 Accepts]: Start accepts. Automaton has 5418 states and 6450 transitions. Word has length 131 [2021-01-07 01:58:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:51,442 INFO L481 AbstractCegarLoop]: Abstraction has 5418 states and 6450 transitions. [2021-01-07 01:58:51,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:58:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 5418 states and 6450 transitions. [2021-01-07 01:58:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-07 01:58:51,451 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:51,451 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:51,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-01-07 01:58:51,668 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:51,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:51,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1326609866, now seen corresponding path program 1 times [2021-01-07 01:58:51,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:51,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342979596] [2021-01-07 01:58:51,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:58:51,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342979596] [2021-01-07 01:58:51,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:51,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:58:51,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080324838] [2021-01-07 01:58:51,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:58:51,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:51,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:58:51,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:58:51,861 INFO L87 Difference]: Start difference. First operand 5418 states and 6450 transitions. Second operand 5 states. [2021-01-07 01:58:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:52,910 INFO L93 Difference]: Finished difference Result 26837 states and 31909 transitions. [2021-01-07 01:58:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 01:58:52,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2021-01-07 01:58:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:53,013 INFO L225 Difference]: With dead ends: 26837 [2021-01-07 01:58:53,013 INFO L226 Difference]: Without dead ends: 21456 [2021-01-07 01:58:53,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:58:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21456 states. [2021-01-07 01:58:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21456 to 5302. [2021-01-07 01:58:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5302 states. [2021-01-07 01:58:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5302 states to 5302 states and 6326 transitions. [2021-01-07 01:58:53,612 INFO L78 Accepts]: Start accepts. Automaton has 5302 states and 6326 transitions. Word has length 131 [2021-01-07 01:58:53,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:53,612 INFO L481 AbstractCegarLoop]: Abstraction has 5302 states and 6326 transitions. [2021-01-07 01:58:53,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:58:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5302 states and 6326 transitions. [2021-01-07 01:58:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-01-07 01:58:53,621 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:53,621 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-01-07 01:58:53,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 01:58:53,622 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:53,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:53,623 INFO L82 PathProgramCache]: Analyzing trace with hash 843094561, now seen corresponding path program 1 times [2021-01-07 01:58:53,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:53,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360055947] [2021-01-07 01:58:53,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:58:53,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360055947] [2021-01-07 01:58:53,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:53,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:58:53,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626768759] [2021-01-07 01:58:53,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:53,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:53,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:53,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:53,859 INFO L87 Difference]: Start difference. First operand 5302 states and 6326 transitions. Second operand 3 states. [2021-01-07 01:58:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:54,367 INFO L93 Difference]: Finished difference Result 10567 states and 12609 transitions. [2021-01-07 01:58:54,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:54,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2021-01-07 01:58:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:54,383 INFO L225 Difference]: With dead ends: 10567 [2021-01-07 01:58:54,383 INFO L226 Difference]: Without dead ends: 5146 [2021-01-07 01:58:54,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2021-01-07 01:58:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 5107. [2021-01-07 01:58:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2021-01-07 01:58:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 6053 transitions. [2021-01-07 01:58:54,929 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 6053 transitions. Word has length 132 [2021-01-07 01:58:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:54,930 INFO L481 AbstractCegarLoop]: Abstraction has 5107 states and 6053 transitions. [2021-01-07 01:58:54,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 6053 transitions. [2021-01-07 01:58:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-01-07 01:58:54,937 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:54,938 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:54,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 01:58:54,938 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:54,939 INFO L82 PathProgramCache]: Analyzing trace with hash -843085277, now seen corresponding path program 1 times [2021-01-07 01:58:54,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:54,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522467455] [2021-01-07 01:58:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:58:55,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522467455] [2021-01-07 01:58:55,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:55,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:58:55,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774510776] [2021-01-07 01:58:55,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:55,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:55,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:55,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:55,117 INFO L87 Difference]: Start difference. First operand 5107 states and 6053 transitions. Second operand 3 states. [2021-01-07 01:58:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:55,438 INFO L93 Difference]: Finished difference Result 7360 states and 8730 transitions. [2021-01-07 01:58:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:55,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2021-01-07 01:58:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:55,445 INFO L225 Difference]: With dead ends: 7360 [2021-01-07 01:58:55,445 INFO L226 Difference]: Without dead ends: 2280 [2021-01-07 01:58:55,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2021-01-07 01:58:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2280. [2021-01-07 01:58:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2021-01-07 01:58:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 2707 transitions. [2021-01-07 01:58:55,647 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 2707 transitions. Word has length 132 [2021-01-07 01:58:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:55,647 INFO L481 AbstractCegarLoop]: Abstraction has 2280 states and 2707 transitions. [2021-01-07 01:58:55,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 2707 transitions. [2021-01-07 01:58:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-07 01:58:55,655 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:55,656 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:55,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 01:58:55,656 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:55,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash -934164480, now seen corresponding path program 1 times [2021-01-07 01:58:55,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:55,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090781743] [2021-01-07 01:58:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-07 01:58:55,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090781743] [2021-01-07 01:58:55,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:55,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:58:55,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119478162] [2021-01-07 01:58:55,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:55,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:55,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:55,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:55,866 INFO L87 Difference]: Start difference. First operand 2280 states and 2707 transitions. Second operand 3 states. [2021-01-07 01:58:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:56,120 INFO L93 Difference]: Finished difference Result 6418 states and 7653 transitions. [2021-01-07 01:58:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:56,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-07 01:58:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:56,131 INFO L225 Difference]: With dead ends: 6418 [2021-01-07 01:58:56,131 INFO L226 Difference]: Without dead ends: 4313 [2021-01-07 01:58:56,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2021-01-07 01:58:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4128. [2021-01-07 01:58:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4128 states. [2021-01-07 01:58:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 4945 transitions. [2021-01-07 01:58:56,441 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 4945 transitions. Word has length 160 [2021-01-07 01:58:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:56,441 INFO L481 AbstractCegarLoop]: Abstraction has 4128 states and 4945 transitions. [2021-01-07 01:58:56,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 4945 transitions. [2021-01-07 01:58:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-07 01:58:56,450 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:56,450 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:56,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 01:58:56,450 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:56,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:56,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1093367299, now seen corresponding path program 1 times [2021-01-07 01:58:56,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:56,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800627896] [2021-01-07 01:58:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-07 01:58:56,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800627896] [2021-01-07 01:58:56,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:56,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:58:56,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717850603] [2021-01-07 01:58:56,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:58:56,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:56,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:58:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:58:56,727 INFO L87 Difference]: Start difference. First operand 4128 states and 4945 transitions. Second operand 5 states. [2021-01-07 01:58:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:57,326 INFO L93 Difference]: Finished difference Result 12159 states and 14571 transitions. [2021-01-07 01:58:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:58:57,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2021-01-07 01:58:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:57,350 INFO L225 Difference]: With dead ends: 12159 [2021-01-07 01:58:57,351 INFO L226 Difference]: Without dead ends: 8109 [2021-01-07 01:58:57,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:58:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8109 states. [2021-01-07 01:58:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8109 to 4128. [2021-01-07 01:58:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4128 states. [2021-01-07 01:58:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 4944 transitions. [2021-01-07 01:58:57,830 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 4944 transitions. Word has length 171 [2021-01-07 01:58:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:57,831 INFO L481 AbstractCegarLoop]: Abstraction has 4128 states and 4944 transitions. [2021-01-07 01:58:57,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:58:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 4944 transitions. [2021-01-07 01:58:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-01-07 01:58:57,841 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:57,841 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:57,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 01:58:57,842 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 967425927, now seen corresponding path program 1 times [2021-01-07 01:58:57,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:57,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020759946] [2021-01-07 01:58:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-01-07 01:58:58,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020759946] [2021-01-07 01:58:58,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:58:58,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:58:58,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97385608] [2021-01-07 01:58:58,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:58:58,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:58:58,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:58:58,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:58,307 INFO L87 Difference]: Start difference. First operand 4128 states and 4944 transitions. Second operand 3 states. [2021-01-07 01:58:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:58:58,656 INFO L93 Difference]: Finished difference Result 8240 states and 9875 transitions. [2021-01-07 01:58:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:58:58,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2021-01-07 01:58:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:58:58,668 INFO L225 Difference]: With dead ends: 8240 [2021-01-07 01:58:58,668 INFO L226 Difference]: Without dead ends: 4132 [2021-01-07 01:58:58,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:58:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4132 states. [2021-01-07 01:58:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4132 to 4132. [2021-01-07 01:58:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4132 states. [2021-01-07 01:58:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 4948 transitions. [2021-01-07 01:58:58,968 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 4948 transitions. Word has length 173 [2021-01-07 01:58:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:58:58,968 INFO L481 AbstractCegarLoop]: Abstraction has 4132 states and 4948 transitions. [2021-01-07 01:58:58,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:58:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 4948 transitions. [2021-01-07 01:58:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-01-07 01:58:58,976 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:58:58,977 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:58:58,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 01:58:58,977 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:58:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:58:58,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1124659397, now seen corresponding path program 1 times [2021-01-07 01:58:58,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:58:58,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645128957] [2021-01-07 01:58:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:58:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-01-07 01:58:59,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645128957] [2021-01-07 01:58:59,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620112889] [2021-01-07 01:58:59,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:58:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:58:59,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 1950 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 01:58:59,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:59:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-07 01:59:00,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:59:00,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-01-07 01:59:00,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172141473] [2021-01-07 01:59:00,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:59:00,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:00,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:59:00,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:59:00,174 INFO L87 Difference]: Start difference. First operand 4132 states and 4948 transitions. Second operand 5 states. [2021-01-07 01:59:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:00,608 INFO L93 Difference]: Finished difference Result 8100 states and 9710 transitions. [2021-01-07 01:59:00,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:59:00,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2021-01-07 01:59:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:00,618 INFO L225 Difference]: With dead ends: 8100 [2021-01-07 01:59:00,618 INFO L226 Difference]: Without dead ends: 4141 [2021-01-07 01:59:00,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:59:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2021-01-07 01:59:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4129. [2021-01-07 01:59:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2021-01-07 01:59:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 4944 transitions. [2021-01-07 01:59:00,939 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 4944 transitions. Word has length 177 [2021-01-07 01:59:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:00,939 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 4944 transitions. [2021-01-07 01:59:00,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:59:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 4944 transitions. [2021-01-07 01:59:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2021-01-07 01:59:00,949 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:00,949 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:01,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 01:59:01,164 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:01,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1407669115, now seen corresponding path program 1 times [2021-01-07 01:59:01,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:01,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599035801] [2021-01-07 01:59:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-07 01:59:01,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599035801] [2021-01-07 01:59:01,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:59:01,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:59:01,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383593192] [2021-01-07 01:59:01,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:59:01,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:01,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:59:01,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:59:01,613 INFO L87 Difference]: Start difference. First operand 4129 states and 4944 transitions. Second operand 5 states. [2021-01-07 01:59:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:01,968 INFO L93 Difference]: Finished difference Result 8110 states and 9719 transitions. [2021-01-07 01:59:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:59:01,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2021-01-07 01:59:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:01,981 INFO L225 Difference]: With dead ends: 8110 [2021-01-07 01:59:01,982 INFO L226 Difference]: Without dead ends: 4129 [2021-01-07 01:59:01,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:59:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2021-01-07 01:59:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 4129. [2021-01-07 01:59:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2021-01-07 01:59:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 4943 transitions. [2021-01-07 01:59:02,293 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 4943 transitions. Word has length 242 [2021-01-07 01:59:02,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:02,293 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 4943 transitions. [2021-01-07 01:59:02,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:59:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 4943 transitions. [2021-01-07 01:59:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2021-01-07 01:59:02,304 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:02,304 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:02,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 01:59:02,305 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:02,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1692971095, now seen corresponding path program 1 times [2021-01-07 01:59:02,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:02,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532967966] [2021-01-07 01:59:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-01-07 01:59:02,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532967966] [2021-01-07 01:59:02,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216479855] [2021-01-07 01:59:02,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:59:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:04,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 2506 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 01:59:04,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:59:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-01-07 01:59:04,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:59:04,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-07 01:59:04,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375070687] [2021-01-07 01:59:04,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:59:04,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:04,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:59:04,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:59:04,851 INFO L87 Difference]: Start difference. First operand 4129 states and 4943 transitions. Second operand 6 states. [2021-01-07 01:59:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:05,287 INFO L93 Difference]: Finished difference Result 8241 states and 9872 transitions. [2021-01-07 01:59:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:59:05,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 244 [2021-01-07 01:59:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:05,295 INFO L225 Difference]: With dead ends: 8241 [2021-01-07 01:59:05,295 INFO L226 Difference]: Without dead ends: 4133 [2021-01-07 01:59:05,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:59:05,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2021-01-07 01:59:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 4133. [2021-01-07 01:59:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4133 states. [2021-01-07 01:59:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4133 states to 4133 states and 4947 transitions. [2021-01-07 01:59:05,665 INFO L78 Accepts]: Start accepts. Automaton has 4133 states and 4947 transitions. Word has length 244 [2021-01-07 01:59:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:05,665 INFO L481 AbstractCegarLoop]: Abstraction has 4133 states and 4947 transitions. [2021-01-07 01:59:05,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:59:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4133 states and 4947 transitions. [2021-01-07 01:59:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2021-01-07 01:59:05,676 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:05,676 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:05,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 01:59:05,892 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash 90497383, now seen corresponding path program 2 times [2021-01-07 01:59:05,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:05,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836614482] [2021-01-07 01:59:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-01-07 01:59:06,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836614482] [2021-01-07 01:59:06,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480902082] [2021-01-07 01:59:06,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:59:07,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 01:59:07,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:59:07,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 01:59:07,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:59:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-01-07 01:59:07,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:59:07,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-01-07 01:59:07,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447226844] [2021-01-07 01:59:07,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:59:07,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:07,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:59:07,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:59:07,411 INFO L87 Difference]: Start difference. First operand 4133 states and 4947 transitions. Second operand 3 states. [2021-01-07 01:59:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:07,864 INFO L93 Difference]: Finished difference Result 8238 states and 9865 transitions. [2021-01-07 01:59:07,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:59:07,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2021-01-07 01:59:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:07,872 INFO L225 Difference]: With dead ends: 8238 [2021-01-07 01:59:07,872 INFO L226 Difference]: Without dead ends: 4135 [2021-01-07 01:59:07,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:59:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2021-01-07 01:59:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 4135. [2021-01-07 01:59:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4135 states. [2021-01-07 01:59:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4135 states to 4135 states and 4949 transitions. [2021-01-07 01:59:08,279 INFO L78 Accepts]: Start accepts. Automaton has 4135 states and 4949 transitions. Word has length 248 [2021-01-07 01:59:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:08,279 INFO L481 AbstractCegarLoop]: Abstraction has 4135 states and 4949 transitions. [2021-01-07 01:59:08,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:59:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 4135 states and 4949 transitions. [2021-01-07 01:59:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-01-07 01:59:08,288 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:08,289 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:08,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:59:08,501 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash -909583897, now seen corresponding path program 1 times [2021-01-07 01:59:08,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:08,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350102537] [2021-01-07 01:59:08,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-07 01:59:09,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350102537] [2021-01-07 01:59:09,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643166576] [2021-01-07 01:59:09,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:59:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:10,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 2542 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-07 01:59:10,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:59:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-07 01:59:10,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:59:10,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-07 01:59:10,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415174903] [2021-01-07 01:59:10,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:59:10,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:10,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:59:10,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:59:10,834 INFO L87 Difference]: Start difference. First operand 4135 states and 4949 transitions. Second operand 8 states. [2021-01-07 01:59:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:11,262 INFO L93 Difference]: Finished difference Result 8252 states and 9883 transitions. [2021-01-07 01:59:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:59:11,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2021-01-07 01:59:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:11,271 INFO L225 Difference]: With dead ends: 8252 [2021-01-07 01:59:11,271 INFO L226 Difference]: Without dead ends: 4139 [2021-01-07 01:59:11,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:59:11,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2021-01-07 01:59:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 4139. [2021-01-07 01:59:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4139 states. [2021-01-07 01:59:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 4953 transitions. [2021-01-07 01:59:11,570 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 4953 transitions. Word has length 250 [2021-01-07 01:59:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:11,571 INFO L481 AbstractCegarLoop]: Abstraction has 4139 states and 4953 transitions. [2021-01-07 01:59:11,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:59:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 4953 transitions. [2021-01-07 01:59:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2021-01-07 01:59:11,578 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:11,578 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:11,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 01:59:11,792 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:11,793 INFO L82 PathProgramCache]: Analyzing trace with hash -417956691, now seen corresponding path program 2 times [2021-01-07 01:59:11,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:11,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727345143] [2021-01-07 01:59:11,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-01-07 01:59:12,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727345143] [2021-01-07 01:59:12,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712538153] [2021-01-07 01:59:12,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:59:14,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 01:59:14,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:59:14,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 2566 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 01:59:14,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:59:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-01-07 01:59:14,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:59:14,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-01-07 01:59:14,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501032045] [2021-01-07 01:59:14,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 01:59:14,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 01:59:14,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:59:14,692 INFO L87 Difference]: Start difference. First operand 4139 states and 4953 transitions. Second operand 10 states. [2021-01-07 01:59:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:15,277 INFO L93 Difference]: Finished difference Result 8259 states and 9890 transitions. [2021-01-07 01:59:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 01:59:15,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2021-01-07 01:59:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:15,285 INFO L225 Difference]: With dead ends: 8259 [2021-01-07 01:59:15,286 INFO L226 Difference]: Without dead ends: 4143 [2021-01-07 01:59:15,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:59:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2021-01-07 01:59:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 4143. [2021-01-07 01:59:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2021-01-07 01:59:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 4957 transitions. [2021-01-07 01:59:15,600 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 4957 transitions. Word has length 254 [2021-01-07 01:59:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:15,600 INFO L481 AbstractCegarLoop]: Abstraction has 4143 states and 4957 transitions. [2021-01-07 01:59:15,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 01:59:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 4957 transitions. [2021-01-07 01:59:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-01-07 01:59:15,607 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:15,608 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:15,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 01:59:15,822 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:15,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:15,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1532768551, now seen corresponding path program 3 times [2021-01-07 01:59:15,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:15,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997427645] [2021-01-07 01:59:15,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-07 01:59:16,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997427645] [2021-01-07 01:59:16,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206225925] [2021-01-07 01:59:16,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:59:17,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 01:59:17,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:59:17,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 01:59:17,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:59:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-01-07 01:59:18,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:59:18,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2021-01-07 01:59:18,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591333439] [2021-01-07 01:59:18,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 01:59:18,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 01:59:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:59:18,209 INFO L87 Difference]: Start difference. First operand 4143 states and 4957 transitions. Second operand 9 states. [2021-01-07 01:59:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:18,752 INFO L93 Difference]: Finished difference Result 8268 states and 9901 transitions. [2021-01-07 01:59:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 01:59:18,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 258 [2021-01-07 01:59:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:18,758 INFO L225 Difference]: With dead ends: 8268 [2021-01-07 01:59:18,759 INFO L226 Difference]: Without dead ends: 4149 [2021-01-07 01:59:18,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-01-07 01:59:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2021-01-07 01:59:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 4149. [2021-01-07 01:59:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4149 states. [2021-01-07 01:59:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 4963 transitions. [2021-01-07 01:59:19,080 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 4963 transitions. Word has length 258 [2021-01-07 01:59:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:19,080 INFO L481 AbstractCegarLoop]: Abstraction has 4149 states and 4963 transitions. [2021-01-07 01:59:19,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 01:59:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 4963 transitions. [2021-01-07 01:59:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-01-07 01:59:19,087 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:19,088 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:19,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:59:19,303 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:19,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1996542167, now seen corresponding path program 4 times [2021-01-07 01:59:19,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:19,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785027033] [2021-01-07 01:59:19,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-07 01:59:19,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785027033] [2021-01-07 01:59:19,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685167149] [2021-01-07 01:59:19,859 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:59:21,433 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 01:59:21,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:59:21,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 2626 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 01:59:21,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:59:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-07 01:59:21,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:59:21,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-01-07 01:59:21,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324619585] [2021-01-07 01:59:21,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 01:59:21,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:59:21,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 01:59:21,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-01-07 01:59:21,867 INFO L87 Difference]: Start difference. First operand 4149 states and 4963 transitions. Second operand 14 states. [2021-01-07 01:59:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:59:22,443 INFO L93 Difference]: Finished difference Result 8277 states and 9908 transitions. [2021-01-07 01:59:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 01:59:22,444 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 264 [2021-01-07 01:59:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:59:22,451 INFO L225 Difference]: With dead ends: 8277 [2021-01-07 01:59:22,451 INFO L226 Difference]: Without dead ends: 4153 [2021-01-07 01:59:22,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-01-07 01:59:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4153 states. [2021-01-07 01:59:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4153 to 4153. [2021-01-07 01:59:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4153 states. [2021-01-07 01:59:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 4967 transitions. [2021-01-07 01:59:22,768 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 4967 transitions. Word has length 264 [2021-01-07 01:59:22,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:59:22,769 INFO L481 AbstractCegarLoop]: Abstraction has 4153 states and 4967 transitions. [2021-01-07 01:59:22,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 01:59:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 4967 transitions. [2021-01-07 01:59:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-01-07 01:59:22,775 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:59:22,776 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:59:22,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:59:22,990 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:59:22,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:59:22,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2010973081, now seen corresponding path program 5 times [2021-01-07 01:59:22,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:59:22,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860780217] [2021-01-07 01:59:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:59:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:59:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-01-07 01:59:23,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860780217] [2021-01-07 01:59:23,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946724430] [2021-01-07 01:59:23,601 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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