/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/seq-pthread/cs_read_write_lock-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 11:39:45,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 11:39:45,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 11:39:46,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 11:39:46,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 11:39:46,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 11:39:46,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 11:39:46,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 11:39:46,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 11:39:46,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 11:39:46,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 11:39:46,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 11:39:46,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 11:39:46,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 11:39:46,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 11:39:46,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 11:39:46,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 11:39:46,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 11:39:46,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 11:39:46,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 11:39:46,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 11:39:46,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 11:39:46,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 11:39:46,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 11:39:46,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 11:39:46,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 11:39:46,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 11:39:46,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 11:39:46,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 11:39:46,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 11:39:46,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 11:39:46,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 11:39:46,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 11:39:46,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 11:39:46,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 11:39:46,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 11:39:46,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 11:39:46,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 11:39:46,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 11:39:46,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 11:39:46,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 11:39:46,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 11:39:46,152 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 11:39:46,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 11:39:46,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 11:39:46,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 11:39:46,154 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 11:39:46,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 11:39:46,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 11:39:46,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 11:39:46,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 11:39:46,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 11:39:46,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 11:39:46,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 11:39:46,156 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 11:39:46,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 11:39:46,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 11:39:46,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 11:39:46,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 11:39:46,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:39:46,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 11:39:46,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 11:39:46,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 11:39:46,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 11:39:46,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 11:39:46,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 11:39:46,159 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 11:39:46,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 11:39:46,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 11:39:46,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 11:39:46,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 11:39:46,589 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 11:39:46,590 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 11:39:46,591 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_read_write_lock-1.i [2020-12-23 11:39:46,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1fd2e9b6e/a4d4c7238b114e71801e3ddafa730139/FLAG58014f330 [2020-12-23 11:39:47,502 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 11:39:47,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_read_write_lock-1.i [2020-12-23 11:39:47,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1fd2e9b6e/a4d4c7238b114e71801e3ddafa730139/FLAG58014f330 [2020-12-23 11:39:47,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1fd2e9b6e/a4d4c7238b114e71801e3ddafa730139 [2020-12-23 11:39:47,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 11:39:47,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 11:39:47,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 11:39:47,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 11:39:47,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 11:39:47,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:39:47" (1/1) ... [2020-12-23 11:39:47,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50aa9ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:47, skipping insertion in model container [2020-12-23 11:39:47,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:39:47" (1/1) ... [2020-12-23 11:39:47,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 11:39:47,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 11:39:47,984 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/seq-pthread/cs_read_write_lock-1.i[23614,23627] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IdentifierExpression[~j~0,]]] left hand side expression in assignment: lhs: VariableLHS[~j~1,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IdentifierExpression[~j~1,]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_allocated~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_born_round~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~w~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~__CS_u~0,GLOBAL],r],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~r~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~r~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~__CS_u~0,GLOBAL],r],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~r~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~r~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~w~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~__CS_u~0,GLOBAL],y],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~y~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~y~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_w~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_r~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_x~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_y~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: VariableLHS[~j~2,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_cp___CS_thread_status~0,],[IdentifierExpression[~i~0,]]],[IdentifierExpression[~j~2,]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_cp___CS_thread_lockedon~0,],[IdentifierExpression[~i~0,]]],[IdentifierExpression[~j~2,]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[3]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[4]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[3]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[4]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~w~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~r~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~y~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_thread_index~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_born_round~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[0]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_allocated~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[3]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[4]]] [2020-12-23 11:39:48,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:39:48,213 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 11:39:48,243 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/seq-pthread/cs_read_write_lock-1.i[23614,23627] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[40],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~j~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[40],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~1,]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[40],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[5],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#w~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#w~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_u~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_u~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#r~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#r~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#r~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#r~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_u~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_u~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#r~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#r~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#r~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#r~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#x~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#w~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#w~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_u~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_u~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#y~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#y~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#y~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#y~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_w~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_w~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_r~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_r~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_x~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_x~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_y~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_y~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~j~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_status~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_status~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[5],IdentifierExpression[~i~0,]]],IdentifierExpression[~j~2,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_lockedon~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_lockedon~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[40],IdentifierExpression[~i~0,]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~2,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#w~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#w~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#r~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#r~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#x~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#y~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#y~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_thread_index~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],offset]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[5],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[5],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[5],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[5],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[5],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]]] [2020-12-23 11:39:48,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:39:48,498 INFO L208 MainTranslator]: Completed translation [2020-12-23 11:39:48,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48 WrapperNode [2020-12-23 11:39:48,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 11:39:48,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 11:39:48,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 11:39:48,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 11:39:48,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48" (1/1) ... [2020-12-23 11:39:48,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48" (1/1) ... [2020-12-23 11:39:48,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 11:39:48,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 11:39:48,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 11:39:48,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 11:39:48,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48" (1/1) ... [2020-12-23 11:39:48,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48" (1/1) ... [2020-12-23 11:39:48,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48" (1/1) ... [2020-12-23 11:39:48,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48" (1/1) ... [2020-12-23 11:39:48,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48" (1/1) ... [2020-12-23 11:39:48,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48" (1/1) ... [2020-12-23 11:39:49,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48" (1/1) ... [2020-12-23 11:39:49,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 11:39:49,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 11:39:49,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 11:39:49,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 11:39:49,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:39:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 11:39:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 11:39:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 11:39:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 11:39:49,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 11:39:49,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 11:39:49,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 11:39:49,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 11:39:49,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 11:39:49,489 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:39:49,509 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:39:49,527 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:39:49,541 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:39:49,552 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:39:55,076 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##647: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:39:55,076 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##646: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:39:55,076 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-18: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:39:55,077 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-44: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:39:55,077 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-70: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:39:55,077 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-96: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:39:55,077 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-122: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:39:55,077 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1114: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:39:55,078 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1115: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:39:55,078 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-14: assume 0 != ~__CS_ret~0 % 256;reader_#res.base, reader_#res.offset := 0, 0; [2020-12-23 11:39:55,078 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-14: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:39:55,078 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-36: assume 0 != ~__CS_ret~0 % 256;reader_#res.base, reader_#res.offset := 0, 0; [2020-12-23 11:39:55,078 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-36: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:39:55,078 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-58: assume 0 != ~__CS_ret~0 % 256;reader_#res.base, reader_#res.offset := 0, 0; [2020-12-23 11:39:55,078 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-58: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:39:55,079 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##412: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:39:55,079 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-80: assume 0 != ~__CS_ret~0 % 256;reader_#res.base, reader_#res.offset := 0, 0; [2020-12-23 11:39:55,079 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-80: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:39:55,079 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##413: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:39:55,079 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-102: assume 0 != ~__CS_ret~0 % 256;reader_#res.base, reader_#res.offset := 0, 0; [2020-12-23 11:39:55,079 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-102: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:39:55,080 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-42: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:39:55,080 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-42: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:39:55,080 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-44: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:39:55,080 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-108: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:39:55,080 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-108: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:39:55,080 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-110: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:39:55,080 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##881: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:39:55,081 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##880: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:39:55,081 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-174: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:39:55,081 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-174: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:39:55,081 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-176: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:39:55,081 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-240: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:39:55,081 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-240: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:39:55,082 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-242: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:39:55,082 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-306: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:39:55,082 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-306: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:39:55,082 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L567-308: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:39:55,082 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##179: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:39:55,082 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##178: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:39:56,127 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 11:39:56,128 INFO L299 CfgBuilder]: Removed 636 assume(true) statements. [2020-12-23 11:39:56,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:39:56 BoogieIcfgContainer [2020-12-23 11:39:56,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 11:39:56,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 11:39:56,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 11:39:56,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 11:39:56,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:39:47" (1/3) ... [2020-12-23 11:39:56,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429ff182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:39:56, skipping insertion in model container [2020-12-23 11:39:56,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:39:48" (2/3) ... [2020-12-23 11:39:56,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429ff182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:39:56, skipping insertion in model container [2020-12-23 11:39:56,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:39:56" (3/3) ... [2020-12-23 11:39:56,141 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_read_write_lock-1.i [2020-12-23 11:39:56,149 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 11:39:56,155 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 11:39:56,177 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 11:39:56,212 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 11:39:56,212 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 11:39:56,212 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 11:39:56,212 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 11:39:56,212 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 11:39:56,212 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 11:39:56,212 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 11:39:56,213 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 11:39:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states. [2020-12-23 11:39:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 11:39:56,277 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:56,278 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] [2020-12-23 11:39:56,279 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:56,286 INFO L82 PathProgramCache]: Analyzing trace with hash 537209623, now seen corresponding path program 1 times [2020-12-23 11:39:56,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:56,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224820244] [2020-12-23 11:39:56,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:39:56,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224820244] [2020-12-23 11:39:56,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:56,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:39:56,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934892545] [2020-12-23 11:39:56,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:39:56,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:39:56,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:39:56,762 INFO L87 Difference]: Start difference. First operand 847 states. Second operand 3 states. [2020-12-23 11:39:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:56,959 INFO L93 Difference]: Finished difference Result 1696 states and 2666 transitions. [2020-12-23 11:39:56,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:39:56,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-23 11:39:56,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:56,997 INFO L225 Difference]: With dead ends: 1696 [2020-12-23 11:39:56,997 INFO L226 Difference]: Without dead ends: 847 [2020-12-23 11:39:57,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:39:57,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2020-12-23 11:39:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2020-12-23 11:39:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2020-12-23 11:39:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1185 transitions. [2020-12-23 11:39:57,127 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1185 transitions. Word has length 44 [2020-12-23 11:39:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:57,129 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1185 transitions. [2020-12-23 11:39:57,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:39:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1185 transitions. [2020-12-23 11:39:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-23 11:39:57,136 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:57,137 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] [2020-12-23 11:39:57,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 11:39:57,137 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:57,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1478100181, now seen corresponding path program 1 times [2020-12-23 11:39:57,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:57,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448208449] [2020-12-23 11:39:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:39:57,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448208449] [2020-12-23 11:39:57,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:57,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:39:57,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832638236] [2020-12-23 11:39:57,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:39:57,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:57,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:39:57,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:39:57,316 INFO L87 Difference]: Start difference. First operand 844 states and 1185 transitions. Second operand 3 states. [2020-12-23 11:39:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:57,365 INFO L93 Difference]: Finished difference Result 1687 states and 2370 transitions. [2020-12-23 11:39:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:39:57,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-23 11:39:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:57,379 INFO L225 Difference]: With dead ends: 1687 [2020-12-23 11:39:57,379 INFO L226 Difference]: Without dead ends: 846 [2020-12-23 11:39:57,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:39:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2020-12-23 11:39:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 845. [2020-12-23 11:39:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2020-12-23 11:39:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1186 transitions. [2020-12-23 11:39:57,419 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1186 transitions. Word has length 47 [2020-12-23 11:39:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:57,420 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1186 transitions. [2020-12-23 11:39:57,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:39:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1186 transitions. [2020-12-23 11:39:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 11:39:57,424 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:57,425 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] [2020-12-23 11:39:57,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 11:39:57,425 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:57,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:57,429 INFO L82 PathProgramCache]: Analyzing trace with hash 199242925, now seen corresponding path program 1 times [2020-12-23 11:39:57,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:57,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580804175] [2020-12-23 11:39:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:39:57,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580804175] [2020-12-23 11:39:57,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50153721] [2020-12-23 11:39:57,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:39:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:57,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 11:39:57,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:39:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:39:58,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:39:58,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-23 11:39:58,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104409004] [2020-12-23 11:39:58,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:39:58,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:58,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:39:58,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:39:58,056 INFO L87 Difference]: Start difference. First operand 845 states and 1186 transitions. Second operand 5 states. [2020-12-23 11:39:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:58,139 INFO L93 Difference]: Finished difference Result 1690 states and 2373 transitions. [2020-12-23 11:39:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:39:58,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-12-23 11:39:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:58,145 INFO L225 Difference]: With dead ends: 1690 [2020-12-23 11:39:58,146 INFO L226 Difference]: Without dead ends: 848 [2020-12-23 11:39:58,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:39:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2020-12-23 11:39:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 847. [2020-12-23 11:39:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2020-12-23 11:39:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1188 transitions. [2020-12-23 11:39:58,173 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1188 transitions. Word has length 49 [2020-12-23 11:39:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:58,173 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 1188 transitions. [2020-12-23 11:39:58,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:39:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1188 transitions. [2020-12-23 11:39:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 11:39:58,176 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:58,176 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] [2020-12-23 11:39:58,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 11:39:58,390 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:58,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:58,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1513231791, now seen corresponding path program 2 times [2020-12-23 11:39:58,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:58,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042487358] [2020-12-23 11:39:58,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 11:39:58,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042487358] [2020-12-23 11:39:58,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659741542] [2020-12-23 11:39:58,480 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:39:58,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 11:39:58,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 11:39:58,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 11:39:58,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:39:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 11:39:59,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:39:59,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 11:39:59,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362295556] [2020-12-23 11:39:59,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:39:59,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:59,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:39:59,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:39:59,020 INFO L87 Difference]: Start difference. First operand 847 states and 1188 transitions. Second operand 3 states. [2020-12-23 11:39:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:59,049 INFO L93 Difference]: Finished difference Result 1523 states and 2135 transitions. [2020-12-23 11:39:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:39:59,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-12-23 11:39:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:59,054 INFO L225 Difference]: With dead ends: 1523 [2020-12-23 11:39:59,055 INFO L226 Difference]: Without dead ends: 847 [2020-12-23 11:39:59,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:39:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2020-12-23 11:39:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2020-12-23 11:39:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2020-12-23 11:39:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1187 transitions. [2020-12-23 11:39:59,077 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1187 transitions. Word has length 51 [2020-12-23 11:39:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:59,077 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 1187 transitions. [2020-12-23 11:39:59,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:39:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1187 transitions. [2020-12-23 11:39:59,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 11:39:59,079 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:59,080 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] [2020-12-23 11:39:59,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:39:59,294 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1900458601, now seen corresponding path program 1 times [2020-12-23 11:39:59,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:59,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029241089] [2020-12-23 11:39:59,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 11:39:59,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029241089] [2020-12-23 11:39:59,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066514535] [2020-12-23 11:39:59,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:39:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:59,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 11:39:59,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:39:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:39:59,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:39:59,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2020-12-23 11:39:59,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383507559] [2020-12-23 11:39:59,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 11:39:59,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 11:39:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:39:59,834 INFO L87 Difference]: Start difference. First operand 847 states and 1187 transitions. Second operand 7 states. [2020-12-23 11:40:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:00,020 INFO L93 Difference]: Finished difference Result 1704 states and 2388 transitions. [2020-12-23 11:40:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 11:40:00,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2020-12-23 11:40:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:00,026 INFO L225 Difference]: With dead ends: 1704 [2020-12-23 11:40:00,026 INFO L226 Difference]: Without dead ends: 860 [2020-12-23 11:40:00,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2020-12-23 11:40:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2020-12-23 11:40:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 858. [2020-12-23 11:40:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2020-12-23 11:40:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1199 transitions. [2020-12-23 11:40:00,050 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1199 transitions. Word has length 61 [2020-12-23 11:40:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:00,053 INFO L481 AbstractCegarLoop]: Abstraction has 858 states and 1199 transitions. [2020-12-23 11:40:00,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 11:40:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1199 transitions. [2020-12-23 11:40:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 11:40:00,056 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:00,056 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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] [2020-12-23 11:40:00,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:40:00,268 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:00,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:00,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1980991783, now seen corresponding path program 2 times [2020-12-23 11:40:00,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:00,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343405518] [2020-12-23 11:40:00,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 11:40:00,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343405518] [2020-12-23 11:40:00,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882263919] [2020-12-23 11:40:00,505 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 [2020-12-23 11:40:00,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 11:40:00,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 11:40:00,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-23 11:40:00,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:40:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:40:01,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:40:01,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2020-12-23 11:40:01,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690830765] [2020-12-23 11:40:01,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:40:01,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:01,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:40:01,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:40:01,006 INFO L87 Difference]: Start difference. First operand 858 states and 1199 transitions. Second operand 6 states. [2020-12-23 11:40:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:04,721 INFO L93 Difference]: Finished difference Result 2056 states and 2860 transitions. [2020-12-23 11:40:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 11:40:04,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-12-23 11:40:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:04,734 INFO L225 Difference]: With dead ends: 2056 [2020-12-23 11:40:04,734 INFO L226 Difference]: Without dead ends: 1238 [2020-12-23 11:40:04,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-12-23 11:40:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-12-23 11:40:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1178. [2020-12-23 11:40:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2020-12-23 11:40:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1539 transitions. [2020-12-23 11:40:04,814 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1539 transitions. Word has length 72 [2020-12-23 11:40:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:04,816 INFO L481 AbstractCegarLoop]: Abstraction has 1178 states and 1539 transitions. [2020-12-23 11:40:04,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:40:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1539 transitions. [2020-12-23 11:40:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 11:40:04,821 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:04,821 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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] [2020-12-23 11:40:05,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:40:05,022 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:05,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:05,023 INFO L82 PathProgramCache]: Analyzing trace with hash 609184485, now seen corresponding path program 1 times [2020-12-23 11:40:05,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:05,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007793461] [2020-12-23 11:40:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 11:40:05,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007793461] [2020-12-23 11:40:05,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799182269] [2020-12-23 11:40:05,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:40:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:05,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 11:40:05,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:40:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 11:40:05,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:40:05,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-12-23 11:40:05,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467353959] [2020-12-23 11:40:05,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 11:40:05,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:05,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 11:40:05,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:40:05,526 INFO L87 Difference]: Start difference. First operand 1178 states and 1539 transitions. Second operand 7 states. [2020-12-23 11:40:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:05,623 INFO L93 Difference]: Finished difference Result 2352 states and 3075 transitions. [2020-12-23 11:40:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:40:05,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2020-12-23 11:40:05,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:05,631 INFO L225 Difference]: With dead ends: 2352 [2020-12-23 11:40:05,631 INFO L226 Difference]: Without dead ends: 1184 [2020-12-23 11:40:05,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:40:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-12-23 11:40:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1182. [2020-12-23 11:40:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2020-12-23 11:40:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1543 transitions. [2020-12-23 11:40:05,668 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1543 transitions. Word has length 72 [2020-12-23 11:40:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:05,668 INFO L481 AbstractCegarLoop]: Abstraction has 1182 states and 1543 transitions. [2020-12-23 11:40:05,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 11:40:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1543 transitions. [2020-12-23 11:40:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 11:40:05,671 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:05,671 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2020-12-23 11:40:05,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 11:40:05,886 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:05,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash -573760987, now seen corresponding path program 2 times [2020-12-23 11:40:05,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:05,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912522920] [2020-12-23 11:40:05,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 11:40:06,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912522920] [2020-12-23 11:40:06,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480754476] [2020-12-23 11:40:06,145 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 [2020-12-23 11:40:06,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 11:40:06,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 11:40:06,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 11:40:06,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:40:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-23 11:40:06,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:40:06,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2020-12-23 11:40:06,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606513173] [2020-12-23 11:40:06,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:40:06,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:06,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:40:06,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:40:06,778 INFO L87 Difference]: Start difference. First operand 1182 states and 1543 transitions. Second operand 4 states. [2020-12-23 11:40:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:06,996 INFO L93 Difference]: Finished difference Result 2185 states and 2857 transitions. [2020-12-23 11:40:06,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:40:06,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 11:40:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:07,009 INFO L225 Difference]: With dead ends: 2185 [2020-12-23 11:40:07,009 INFO L226 Difference]: Without dead ends: 2036 [2020-12-23 11:40:07,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:40:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2020-12-23 11:40:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 2032. [2020-12-23 11:40:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2020-12-23 11:40:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2650 transitions. [2020-12-23 11:40:07,080 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2650 transitions. Word has length 76 [2020-12-23 11:40:07,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:07,080 INFO L481 AbstractCegarLoop]: Abstraction has 2032 states and 2650 transitions. [2020-12-23 11:40:07,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:40:07,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2650 transitions. [2020-12-23 11:40:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 11:40:07,087 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:07,087 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:40:07,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:40:07,301 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:07,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:07,301 INFO L82 PathProgramCache]: Analyzing trace with hash 547507605, now seen corresponding path program 1 times [2020-12-23 11:40:07,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:07,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387424956] [2020-12-23 11:40:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-23 11:40:07,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387424956] [2020-12-23 11:40:07,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:07,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:40:07,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272582285] [2020-12-23 11:40:07,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:40:07,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:07,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:40:07,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:40:07,633 INFO L87 Difference]: Start difference. First operand 2032 states and 2650 transitions. Second operand 4 states. [2020-12-23 11:40:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:08,335 INFO L93 Difference]: Finished difference Result 5820 states and 7566 transitions. [2020-12-23 11:40:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:40:08,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-12-23 11:40:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:08,360 INFO L225 Difference]: With dead ends: 5820 [2020-12-23 11:40:08,360 INFO L226 Difference]: Without dead ends: 4033 [2020-12-23 11:40:08,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:40:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2020-12-23 11:40:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 1965. [2020-12-23 11:40:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-12-23 11:40:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2564 transitions. [2020-12-23 11:40:08,465 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2564 transitions. Word has length 103 [2020-12-23 11:40:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:08,466 INFO L481 AbstractCegarLoop]: Abstraction has 1965 states and 2564 transitions. [2020-12-23 11:40:08,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:40:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2564 transitions. [2020-12-23 11:40:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 11:40:08,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:08,472 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2020-12-23 11:40:08,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 11:40:08,472 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:08,472 INFO L82 PathProgramCache]: Analyzing trace with hash -318130092, now seen corresponding path program 1 times [2020-12-23 11:40:08,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:08,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371113942] [2020-12-23 11:40:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-23 11:40:08,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371113942] [2020-12-23 11:40:08,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:08,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:40:08,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708180819] [2020-12-23 11:40:08,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:40:08,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:08,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:40:08,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:40:08,616 INFO L87 Difference]: Start difference. First operand 1965 states and 2564 transitions. Second operand 3 states. [2020-12-23 11:40:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:11,242 INFO L93 Difference]: Finished difference Result 5748 states and 7512 transitions. [2020-12-23 11:40:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:40:11,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-12-23 11:40:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:11,266 INFO L225 Difference]: With dead ends: 5748 [2020-12-23 11:40:11,266 INFO L226 Difference]: Without dead ends: 3861 [2020-12-23 11:40:11,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:40:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2020-12-23 11:40:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3557. [2020-12-23 11:40:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3557 states. [2020-12-23 11:40:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4636 transitions. [2020-12-23 11:40:11,449 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4636 transitions. Word has length 111 [2020-12-23 11:40:11,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:11,449 INFO L481 AbstractCegarLoop]: Abstraction has 3557 states and 4636 transitions. [2020-12-23 11:40:11,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:40:11,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4636 transitions. [2020-12-23 11:40:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 11:40:11,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:11,457 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2020-12-23 11:40:11,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 11:40:11,458 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash -263737194, now seen corresponding path program 1 times [2020-12-23 11:40:11,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:11,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229649558] [2020-12-23 11:40:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 11:40:11,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229649558] [2020-12-23 11:40:11,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691199327] [2020-12-23 11:40:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:40:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:12,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 11:40:12,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:40:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 11:40:12,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:40:12,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-12-23 11:40:12,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470454011] [2020-12-23 11:40:12,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 11:40:12,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 11:40:12,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:40:12,277 INFO L87 Difference]: Start difference. First operand 3557 states and 4636 transitions. Second operand 8 states. [2020-12-23 11:40:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:12,483 INFO L93 Difference]: Finished difference Result 7106 states and 9265 transitions. [2020-12-23 11:40:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 11:40:12,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2020-12-23 11:40:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:12,504 INFO L225 Difference]: With dead ends: 7106 [2020-12-23 11:40:12,504 INFO L226 Difference]: Without dead ends: 3561 [2020-12-23 11:40:12,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:40:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2020-12-23 11:40:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3561. [2020-12-23 11:40:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2020-12-23 11:40:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 4640 transitions. [2020-12-23 11:40:12,631 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 4640 transitions. Word has length 111 [2020-12-23 11:40:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:12,631 INFO L481 AbstractCegarLoop]: Abstraction has 3561 states and 4640 transitions. [2020-12-23 11:40:12,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 11:40:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 4640 transitions. [2020-12-23 11:40:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 11:40:12,641 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:12,641 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:40:12,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:40:12,856 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:12,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1528674390, now seen corresponding path program 2 times [2020-12-23 11:40:12,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:12,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015922202] [2020-12-23 11:40:12,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:40:13,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015922202] [2020-12-23 11:40:13,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:13,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:40:13,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345965047] [2020-12-23 11:40:13,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:40:13,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:40:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:40:13,102 INFO L87 Difference]: Start difference. First operand 3561 states and 4640 transitions. Second operand 3 states. [2020-12-23 11:40:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:13,646 INFO L93 Difference]: Finished difference Result 6238 states and 8066 transitions. [2020-12-23 11:40:13,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:40:13,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-12-23 11:40:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:13,671 INFO L225 Difference]: With dead ends: 6238 [2020-12-23 11:40:13,671 INFO L226 Difference]: Without dead ends: 4342 [2020-12-23 11:40:13,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:40:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2020-12-23 11:40:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 4170. [2020-12-23 11:40:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4170 states. [2020-12-23 11:40:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 5413 transitions. [2020-12-23 11:40:13,829 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 5413 transitions. Word has length 115 [2020-12-23 11:40:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:13,829 INFO L481 AbstractCegarLoop]: Abstraction has 4170 states and 5413 transitions. [2020-12-23 11:40:13,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:40:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5413 transitions. [2020-12-23 11:40:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 11:40:13,840 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:13,841 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:40:13,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 11:40:13,841 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:13,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:13,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1927259244, now seen corresponding path program 1 times [2020-12-23 11:40:13,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:13,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968358388] [2020-12-23 11:40:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:40:14,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968358388] [2020-12-23 11:40:14,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:14,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:40:14,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228692355] [2020-12-23 11:40:14,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:40:14,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:14,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:40:14,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:40:14,073 INFO L87 Difference]: Start difference. First operand 4170 states and 5413 transitions. Second operand 4 states. [2020-12-23 11:40:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:14,965 INFO L93 Difference]: Finished difference Result 7071 states and 9108 transitions. [2020-12-23 11:40:14,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:40:14,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2020-12-23 11:40:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:14,993 INFO L225 Difference]: With dead ends: 7071 [2020-12-23 11:40:14,993 INFO L226 Difference]: Without dead ends: 5184 [2020-12-23 11:40:14,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:40:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5184 states. [2020-12-23 11:40:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5184 to 4838. [2020-12-23 11:40:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4838 states. [2020-12-23 11:40:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 6257 transitions. [2020-12-23 11:40:15,147 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 6257 transitions. Word has length 115 [2020-12-23 11:40:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:15,149 INFO L481 AbstractCegarLoop]: Abstraction has 4838 states and 6257 transitions. [2020-12-23 11:40:15,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:40:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 6257 transitions. [2020-12-23 11:40:15,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 11:40:15,160 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:15,160 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:40:15,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 11:40:15,161 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:15,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1345964500, now seen corresponding path program 1 times [2020-12-23 11:40:15,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:15,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660668471] [2020-12-23 11:40:15,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:40:15,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660668471] [2020-12-23 11:40:15,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:15,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 11:40:15,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150180072] [2020-12-23 11:40:15,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:40:15,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:15,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:40:15,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:40:15,432 INFO L87 Difference]: Start difference. First operand 4838 states and 6257 transitions. Second operand 6 states. [2020-12-23 11:40:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:21,387 INFO L93 Difference]: Finished difference Result 8561 states and 10961 transitions. [2020-12-23 11:40:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:40:21,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2020-12-23 11:40:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:21,421 INFO L225 Difference]: With dead ends: 8561 [2020-12-23 11:40:21,421 INFO L226 Difference]: Without dead ends: 6683 [2020-12-23 11:40:21,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:40:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2020-12-23 11:40:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 5983. [2020-12-23 11:40:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5983 states. [2020-12-23 11:40:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 7675 transitions. [2020-12-23 11:40:21,648 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 7675 transitions. Word has length 115 [2020-12-23 11:40:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:21,648 INFO L481 AbstractCegarLoop]: Abstraction has 5983 states and 7675 transitions. [2020-12-23 11:40:21,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:40:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 7675 transitions. [2020-12-23 11:40:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 11:40:21,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:21,663 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:40:21,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 11:40:21,664 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:21,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1688085546, now seen corresponding path program 1 times [2020-12-23 11:40:21,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:21,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699088343] [2020-12-23 11:40:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:27,069 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2020-12-23 11:40:27,375 WARN L197 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 98 [2020-12-23 11:40:27,780 WARN L197 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 114 [2020-12-23 11:40:28,031 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2020-12-23 11:40:28,330 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 73 [2020-12-23 11:40:28,661 WARN L197 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 78 [2020-12-23 11:40:29,053 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 76 [2020-12-23 11:40:29,632 WARN L197 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 75 [2020-12-23 11:40:30,138 WARN L197 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 74 [2020-12-23 11:40:30,622 WARN L197 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 79 [2020-12-23 11:40:30,865 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2020-12-23 11:40:31,199 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2020-12-23 11:40:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:40:31,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699088343] [2020-12-23 11:40:31,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:31,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 11:40:31,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378464254] [2020-12-23 11:40:31,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 11:40:31,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:31,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 11:40:31,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:40:31,494 INFO L87 Difference]: Start difference. First operand 5983 states and 7675 transitions. Second operand 15 states. [2020-12-23 11:40:34,952 WARN L197 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 122 [2020-12-23 11:40:35,596 WARN L197 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 128 [2020-12-23 11:40:36,247 WARN L197 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 130 [2020-12-23 11:40:37,135 WARN L197 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 139 [2020-12-23 11:40:37,932 WARN L197 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 142 [2020-12-23 11:40:39,677 WARN L197 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 131 [2020-12-23 11:40:42,051 WARN L197 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 139 [2020-12-23 11:40:42,918 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 115 [2020-12-23 11:40:44,831 WARN L197 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 124 [2020-12-23 11:40:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:54,726 INFO L93 Difference]: Finished difference Result 9925 states and 12805 transitions. [2020-12-23 11:40:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 11:40:54,727 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2020-12-23 11:40:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:54,743 INFO L225 Difference]: With dead ends: 9925 [2020-12-23 11:40:54,743 INFO L226 Difference]: Without dead ends: 8328 [2020-12-23 11:40:54,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2020-12-23 11:40:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2020-12-23 11:40:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 6241. [2020-12-23 11:40:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2020-12-23 11:40:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 7994 transitions. [2020-12-23 11:40:54,980 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 7994 transitions. Word has length 115 [2020-12-23 11:40:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:54,980 INFO L481 AbstractCegarLoop]: Abstraction has 6241 states and 7994 transitions. [2020-12-23 11:40:54,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 11:40:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 7994 transitions. [2020-12-23 11:40:54,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:40:54,993 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:54,993 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:40:54,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 11:40:54,994 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:54,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:54,994 INFO L82 PathProgramCache]: Analyzing trace with hash 187208037, now seen corresponding path program 1 times [2020-12-23 11:40:54,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:54,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813272296] [2020-12-23 11:40:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:40:55,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813272296] [2020-12-23 11:40:55,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:55,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:40:55,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721858711] [2020-12-23 11:40:55,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:40:55,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:55,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:40:55,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:40:55,243 INFO L87 Difference]: Start difference. First operand 6241 states and 7994 transitions. Second operand 4 states. [2020-12-23 11:40:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:57,780 INFO L93 Difference]: Finished difference Result 6615 states and 8436 transitions. [2020-12-23 11:40:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:40:57,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2020-12-23 11:40:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:57,793 INFO L225 Difference]: With dead ends: 6615 [2020-12-23 11:40:57,794 INFO L226 Difference]: Without dead ends: 6145 [2020-12-23 11:40:57,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:40:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6145 states. [2020-12-23 11:40:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6145 to 6037. [2020-12-23 11:40:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6037 states. [2020-12-23 11:40:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6037 states to 6037 states and 7738 transitions. [2020-12-23 11:40:58,006 INFO L78 Accepts]: Start accepts. Automaton has 6037 states and 7738 transitions. Word has length 117 [2020-12-23 11:40:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:58,007 INFO L481 AbstractCegarLoop]: Abstraction has 6037 states and 7738 transitions. [2020-12-23 11:40:58,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:40:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6037 states and 7738 transitions. [2020-12-23 11:40:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:40:58,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:58,020 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:40:58,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 11:40:58,020 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash -118382953, now seen corresponding path program 1 times [2020-12-23 11:40:58,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:58,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346652302] [2020-12-23 11:40:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:40:58,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346652302] [2020-12-23 11:40:58,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:58,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:40:58,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276995084] [2020-12-23 11:40:58,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:40:58,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:58,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:40:58,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:40:58,237 INFO L87 Difference]: Start difference. First operand 6037 states and 7738 transitions. Second operand 4 states. [2020-12-23 11:41:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:00,766 INFO L93 Difference]: Finished difference Result 6877 states and 8771 transitions. [2020-12-23 11:41:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:41:00,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2020-12-23 11:41:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:00,778 INFO L225 Difference]: With dead ends: 6877 [2020-12-23 11:41:00,779 INFO L226 Difference]: Without dead ends: 5829 [2020-12-23 11:41:00,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:41:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5829 states. [2020-12-23 11:41:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5829 to 5719. [2020-12-23 11:41:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5719 states. [2020-12-23 11:41:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 7334 transitions. [2020-12-23 11:41:00,971 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 7334 transitions. Word has length 117 [2020-12-23 11:41:00,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:00,971 INFO L481 AbstractCegarLoop]: Abstraction has 5719 states and 7334 transitions. [2020-12-23 11:41:00,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:41:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 7334 transitions. [2020-12-23 11:41:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:41:00,986 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:00,986 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:41:00,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 11:41:00,986 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:00,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:00,987 INFO L82 PathProgramCache]: Analyzing trace with hash 598205138, now seen corresponding path program 1 times [2020-12-23 11:41:00,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:00,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293786189] [2020-12-23 11:41:00,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:41:01,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293786189] [2020-12-23 11:41:01,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:41:01,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:41:01,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135183422] [2020-12-23 11:41:01,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:41:01,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:01,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:41:01,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:41:01,193 INFO L87 Difference]: Start difference. First operand 5719 states and 7334 transitions. Second operand 4 states. [2020-12-23 11:41:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:03,725 INFO L93 Difference]: Finished difference Result 8059 states and 10305 transitions. [2020-12-23 11:41:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:41:03,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2020-12-23 11:41:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:03,736 INFO L225 Difference]: With dead ends: 8059 [2020-12-23 11:41:03,736 INFO L226 Difference]: Without dead ends: 5513 [2020-12-23 11:41:03,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:41:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2020-12-23 11:41:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5401. [2020-12-23 11:41:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5401 states. [2020-12-23 11:41:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 6930 transitions. [2020-12-23 11:41:03,945 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 6930 transitions. Word has length 117 [2020-12-23 11:41:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:03,946 INFO L481 AbstractCegarLoop]: Abstraction has 5401 states and 6930 transitions. [2020-12-23 11:41:03,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:41:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 6930 transitions. [2020-12-23 11:41:03,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:41:03,957 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:03,957 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:41:03,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 11:41:03,957 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:03,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2031995277, now seen corresponding path program 1 times [2020-12-23 11:41:03,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:03,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601010019] [2020-12-23 11:41:03,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:41:04,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601010019] [2020-12-23 11:41:04,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:41:04,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:41:04,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129447849] [2020-12-23 11:41:04,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:41:04,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:04,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:41:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:41:04,140 INFO L87 Difference]: Start difference. First operand 5401 states and 6930 transitions. Second operand 4 states. [2020-12-23 11:41:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:06,578 INFO L93 Difference]: Finished difference Result 8832 states and 11346 transitions. [2020-12-23 11:41:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:41:06,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2020-12-23 11:41:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:06,587 INFO L225 Difference]: With dead ends: 8832 [2020-12-23 11:41:06,588 INFO L226 Difference]: Without dead ends: 5153 [2020-12-23 11:41:06,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:41:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2020-12-23 11:41:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 5153. [2020-12-23 11:41:06,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2020-12-23 11:41:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 6630 transitions. [2020-12-23 11:41:06,735 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 6630 transitions. Word has length 117 [2020-12-23 11:41:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:06,735 INFO L481 AbstractCegarLoop]: Abstraction has 5153 states and 6630 transitions. [2020-12-23 11:41:06,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:41:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 6630 transitions. [2020-12-23 11:41:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 11:41:06,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:06,744 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:41:06,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 11:41:06,745 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:06,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:06,745 INFO L82 PathProgramCache]: Analyzing trace with hash 211353689, now seen corresponding path program 1 times [2020-12-23 11:41:06,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:06,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706433996] [2020-12-23 11:41:06,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:41:06,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706433996] [2020-12-23 11:41:06,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:41:06,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:41:06,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402539467] [2020-12-23 11:41:06,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:41:06,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:06,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:41:06,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:41:06,883 INFO L87 Difference]: Start difference. First operand 5153 states and 6630 transitions. Second operand 3 states. [2020-12-23 11:41:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:07,351 INFO L93 Difference]: Finished difference Result 8258 states and 10720 transitions. [2020-12-23 11:41:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:41:07,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-12-23 11:41:07,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:07,362 INFO L225 Difference]: With dead ends: 8258 [2020-12-23 11:41:07,362 INFO L226 Difference]: Without dead ends: 5212 [2020-12-23 11:41:07,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:41:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2020-12-23 11:41:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 5212. [2020-12-23 11:41:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5212 states. [2020-12-23 11:41:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 6685 transitions. [2020-12-23 11:41:07,554 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 6685 transitions. Word has length 118 [2020-12-23 11:41:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:07,554 INFO L481 AbstractCegarLoop]: Abstraction has 5212 states and 6685 transitions. [2020-12-23 11:41:07,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:41:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 6685 transitions. [2020-12-23 11:41:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 11:41:07,565 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:07,565 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:41:07,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 11:41:07,566 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:07,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1749693719, now seen corresponding path program 1 times [2020-12-23 11:41:07,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:07,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323144189] [2020-12-23 11:41:07,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:17,100 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2020-12-23 11:41:17,272 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2020-12-23 11:41:17,449 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2020-12-23 11:41:17,650 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2020-12-23 11:41:17,937 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2020-12-23 11:41:18,241 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 74 [2020-12-23 11:41:18,550 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2020-12-23 11:41:18,936 WARN L197 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2020-12-23 11:41:19,281 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 67 [2020-12-23 11:41:19,549 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2020-12-23 11:41:19,732 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-12-23 11:41:19,921 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-12-23 11:41:20,110 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2020-12-23 11:41:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:41:20,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323144189] [2020-12-23 11:41:20,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:41:20,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 11:41:20,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605575751] [2020-12-23 11:41:20,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 11:41:20,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 11:41:20,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-12-23 11:41:20,389 INFO L87 Difference]: Start difference. First operand 5212 states and 6685 transitions. Second operand 16 states. [2020-12-23 11:41:23,083 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-12-23 11:41:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:34,888 INFO L93 Difference]: Finished difference Result 11181 states and 14334 transitions. [2020-12-23 11:41:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 11:41:34,889 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 118 [2020-12-23 11:41:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:34,900 INFO L225 Difference]: With dead ends: 11181 [2020-12-23 11:41:34,900 INFO L226 Difference]: Without dead ends: 7896 [2020-12-23 11:41:34,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2020-12-23 11:41:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7896 states. [2020-12-23 11:41:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7896 to 5212. [2020-12-23 11:41:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5212 states. [2020-12-23 11:41:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 6680 transitions. [2020-12-23 11:41:35,107 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 6680 transitions. Word has length 118 [2020-12-23 11:41:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:35,107 INFO L481 AbstractCegarLoop]: Abstraction has 5212 states and 6680 transitions. [2020-12-23 11:41:35,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 11:41:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 6680 transitions. [2020-12-23 11:41:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 11:41:35,125 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:35,125 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:41:35,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 11:41:35,126 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:35,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:35,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1628460888, now seen corresponding path program 1 times [2020-12-23 11:41:35,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:35,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645297675] [2020-12-23 11:41:35,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:41:35,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645297675] [2020-12-23 11:41:35,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:41:35,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:41:35,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084624335] [2020-12-23 11:41:35,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:41:35,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:35,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:41:35,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:41:35,297 INFO L87 Difference]: Start difference. First operand 5212 states and 6680 transitions. Second operand 3 states. [2020-12-23 11:41:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:36,818 INFO L93 Difference]: Finished difference Result 9658 states and 12315 transitions. [2020-12-23 11:41:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:41:36,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2020-12-23 11:41:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:36,829 INFO L225 Difference]: With dead ends: 9658 [2020-12-23 11:41:36,830 INFO L226 Difference]: Without dead ends: 5673 [2020-12-23 11:41:36,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:41:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2020-12-23 11:41:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 5212. [2020-12-23 11:41:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5212 states. [2020-12-23 11:41:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 6653 transitions. [2020-12-23 11:41:37,057 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 6653 transitions. Word has length 124 [2020-12-23 11:41:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:37,058 INFO L481 AbstractCegarLoop]: Abstraction has 5212 states and 6653 transitions. [2020-12-23 11:41:37,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:41:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 6653 transitions. [2020-12-23 11:41:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 11:41:37,065 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:37,065 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:41:37,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 11:41:37,065 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:37,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:37,066 INFO L82 PathProgramCache]: Analyzing trace with hash -241675478, now seen corresponding path program 1 times [2020-12-23 11:41:37,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:37,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500453150] [2020-12-23 11:41:37,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:41:37,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500453150] [2020-12-23 11:41:37,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:41:37,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:41:37,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074817771] [2020-12-23 11:41:37,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:41:37,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:41:37,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:41:37,802 INFO L87 Difference]: Start difference. First operand 5212 states and 6653 transitions. Second operand 5 states. [2020-12-23 11:41:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:40,712 INFO L93 Difference]: Finished difference Result 9630 states and 12255 transitions. [2020-12-23 11:41:40,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:41:40,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2020-12-23 11:41:40,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:40,718 INFO L225 Difference]: With dead ends: 9630 [2020-12-23 11:41:40,718 INFO L226 Difference]: Without dead ends: 5526 [2020-12-23 11:41:40,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:41:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2020-12-23 11:41:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 4983. [2020-12-23 11:41:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2020-12-23 11:41:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 6364 transitions. [2020-12-23 11:41:40,918 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 6364 transitions. Word has length 124 [2020-12-23 11:41:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:40,919 INFO L481 AbstractCegarLoop]: Abstraction has 4983 states and 6364 transitions. [2020-12-23 11:41:40,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:41:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 6364 transitions. [2020-12-23 11:41:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 11:41:40,926 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:40,927 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:41:40,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 11:41:40,927 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:40,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2043041219, now seen corresponding path program 1 times [2020-12-23 11:41:40,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:40,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807490171] [2020-12-23 11:41:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:41:45,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807490171] [2020-12-23 11:41:45,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:41:45,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 11:41:45,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583179422] [2020-12-23 11:41:45,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 11:41:45,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:45,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 11:41:45,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-12-23 11:41:45,339 INFO L87 Difference]: Start difference. First operand 4983 states and 6364 transitions. Second operand 12 states. [2020-12-23 11:41:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:50,092 INFO L93 Difference]: Finished difference Result 10452 states and 13175 transitions. [2020-12-23 11:41:50,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 11:41:50,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2020-12-23 11:41:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:50,101 INFO L225 Difference]: With dead ends: 10452 [2020-12-23 11:41:50,101 INFO L226 Difference]: Without dead ends: 6872 [2020-12-23 11:41:50,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2020-12-23 11:41:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6872 states. [2020-12-23 11:41:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6872 to 4255. [2020-12-23 11:41:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4255 states. [2020-12-23 11:41:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5408 transitions. [2020-12-23 11:41:50,248 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5408 transitions. Word has length 128 [2020-12-23 11:41:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:50,248 INFO L481 AbstractCegarLoop]: Abstraction has 4255 states and 5408 transitions. [2020-12-23 11:41:50,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 11:41:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5408 transitions. [2020-12-23 11:41:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-23 11:41:50,254 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:50,254 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:41:50,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 11:41:50,255 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:50,255 INFO L82 PathProgramCache]: Analyzing trace with hash 762294869, now seen corresponding path program 1 times [2020-12-23 11:41:50,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:50,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631361745] [2020-12-23 11:41:50,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:00,150 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2020-12-23 11:42:00,323 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-12-23 11:42:00,511 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2020-12-23 11:42:00,701 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-12-23 11:42:00,904 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2020-12-23 11:42:01,244 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2020-12-23 11:42:01,673 WARN L197 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2020-12-23 11:42:01,954 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2020-12-23 11:42:02,238 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2020-12-23 11:42:02,448 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-12-23 11:42:02,655 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2020-12-23 11:42:02,832 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2020-12-23 11:42:03,009 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2020-12-23 11:42:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:42:03,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631361745] [2020-12-23 11:42:03,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:03,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 11:42:03,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034975439] [2020-12-23 11:42:03,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 11:42:03,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:03,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 11:42:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-12-23 11:42:03,243 INFO L87 Difference]: Start difference. First operand 4255 states and 5408 transitions. Second operand 16 states. [2020-12-23 11:42:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:13,632 INFO L93 Difference]: Finished difference Result 8469 states and 10762 transitions. [2020-12-23 11:42:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 11:42:13,635 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2020-12-23 11:42:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:13,643 INFO L225 Difference]: With dead ends: 8469 [2020-12-23 11:42:13,644 INFO L226 Difference]: Without dead ends: 7043 [2020-12-23 11:42:13,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2020-12-23 11:42:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7043 states. [2020-12-23 11:42:13,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7043 to 4295. [2020-12-23 11:42:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4295 states. [2020-12-23 11:42:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 5452 transitions. [2020-12-23 11:42:13,838 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 5452 transitions. Word has length 129 [2020-12-23 11:42:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:13,838 INFO L481 AbstractCegarLoop]: Abstraction has 4295 states and 5452 transitions. [2020-12-23 11:42:13,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 11:42:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 5452 transitions. [2020-12-23 11:42:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 11:42:13,844 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:13,844 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:42:13,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 11:42:13,844 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:13,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:13,845 INFO L82 PathProgramCache]: Analyzing trace with hash 724493226, now seen corresponding path program 1 times [2020-12-23 11:42:13,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:13,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103354615] [2020-12-23 11:42:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:42:15,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103354615] [2020-12-23 11:42:15,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:15,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 11:42:15,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646551803] [2020-12-23 11:42:15,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 11:42:15,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 11:42:15,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:42:15,817 INFO L87 Difference]: Start difference. First operand 4295 states and 5452 transitions. Second operand 7 states. [2020-12-23 11:42:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:18,618 INFO L93 Difference]: Finished difference Result 7100 states and 8995 transitions. [2020-12-23 11:42:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 11:42:18,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2020-12-23 11:42:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:18,625 INFO L225 Difference]: With dead ends: 7100 [2020-12-23 11:42:18,625 INFO L226 Difference]: Without dead ends: 4443 [2020-12-23 11:42:18,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:42:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2020-12-23 11:42:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4093. [2020-12-23 11:42:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4093 states. [2020-12-23 11:42:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 5197 transitions. [2020-12-23 11:42:18,795 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 5197 transitions. Word has length 131 [2020-12-23 11:42:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:18,796 INFO L481 AbstractCegarLoop]: Abstraction has 4093 states and 5197 transitions. [2020-12-23 11:42:18,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 11:42:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 5197 transitions. [2020-12-23 11:42:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 11:42:18,800 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:18,800 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:42:18,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 11:42:18,800 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:18,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1422624458, now seen corresponding path program 1 times [2020-12-23 11:42:18,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:18,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988649239] [2020-12-23 11:42:18,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:42:19,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988649239] [2020-12-23 11:42:19,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:19,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:42:19,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86914068] [2020-12-23 11:42:19,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:42:19,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:19,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:42:19,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:42:19,440 INFO L87 Difference]: Start difference. First operand 4093 states and 5197 transitions. Second operand 5 states. [2020-12-23 11:42:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:22,130 INFO L93 Difference]: Finished difference Result 4485 states and 5655 transitions. [2020-12-23 11:42:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:42:22,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2020-12-23 11:42:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:22,136 INFO L225 Difference]: With dead ends: 4485 [2020-12-23 11:42:22,136 INFO L226 Difference]: Without dead ends: 4076 [2020-12-23 11:42:22,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:42:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2020-12-23 11:42:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3974. [2020-12-23 11:42:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3974 states. [2020-12-23 11:42:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5040 transitions. [2020-12-23 11:42:22,258 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5040 transitions. Word has length 135 [2020-12-23 11:42:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:22,258 INFO L481 AbstractCegarLoop]: Abstraction has 3974 states and 5040 transitions. [2020-12-23 11:42:22,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:42:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5040 transitions. [2020-12-23 11:42:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 11:42:22,262 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:22,262 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:42:22,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 11:42:22,263 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:22,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:22,263 INFO L82 PathProgramCache]: Analyzing trace with hash -896033924, now seen corresponding path program 1 times [2020-12-23 11:42:22,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:22,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772502468] [2020-12-23 11:42:22,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:42:23,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772502468] [2020-12-23 11:42:23,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:23,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:42:23,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708597551] [2020-12-23 11:42:23,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:42:23,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:23,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:42:23,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:42:23,621 INFO L87 Difference]: Start difference. First operand 3974 states and 5040 transitions. Second operand 5 states. [2020-12-23 11:42:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:26,333 INFO L93 Difference]: Finished difference Result 4984 states and 6299 transitions. [2020-12-23 11:42:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:42:26,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2020-12-23 11:42:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:26,337 INFO L225 Difference]: With dead ends: 4984 [2020-12-23 11:42:26,337 INFO L226 Difference]: Without dead ends: 3849 [2020-12-23 11:42:26,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:42:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2020-12-23 11:42:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 3745. [2020-12-23 11:42:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3745 states. [2020-12-23 11:42:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3745 states to 3745 states and 4751 transitions. [2020-12-23 11:42:26,503 INFO L78 Accepts]: Start accepts. Automaton has 3745 states and 4751 transitions. Word has length 135 [2020-12-23 11:42:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:26,503 INFO L481 AbstractCegarLoop]: Abstraction has 3745 states and 4751 transitions. [2020-12-23 11:42:26,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:42:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3745 states and 4751 transitions. [2020-12-23 11:42:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 11:42:26,508 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:26,508 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:42:26,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 11:42:26,508 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:26,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:26,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2001926345, now seen corresponding path program 1 times [2020-12-23 11:42:26,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:26,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118217755] [2020-12-23 11:42:26,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:42:28,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118217755] [2020-12-23 11:42:28,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:28,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:42:28,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387651750] [2020-12-23 11:42:28,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:42:28,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:28,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:42:28,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:42:28,783 INFO L87 Difference]: Start difference. First operand 3745 states and 4751 transitions. Second operand 5 states. [2020-12-23 11:42:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:31,244 INFO L93 Difference]: Finished difference Result 5745 states and 7313 transitions. [2020-12-23 11:42:31,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:42:31,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2020-12-23 11:42:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:31,250 INFO L225 Difference]: With dead ends: 5745 [2020-12-23 11:42:31,250 INFO L226 Difference]: Without dead ends: 3584 [2020-12-23 11:42:31,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:42:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2020-12-23 11:42:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3584. [2020-12-23 11:42:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2020-12-23 11:42:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4561 transitions. [2020-12-23 11:42:31,368 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4561 transitions. Word has length 135 [2020-12-23 11:42:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:31,369 INFO L481 AbstractCegarLoop]: Abstraction has 3584 states and 4561 transitions. [2020-12-23 11:42:31,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:42:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4561 transitions. [2020-12-23 11:42:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-23 11:42:31,372 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:31,372 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:42:31,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 11:42:31,372 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:31,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:31,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1922740211, now seen corresponding path program 1 times [2020-12-23 11:42:31,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:31,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46183920] [2020-12-23 11:42:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:42:33,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46183920] [2020-12-23 11:42:33,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:33,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 11:42:33,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041324043] [2020-12-23 11:42:33,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:42:33,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:33,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:42:33,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:42:33,467 INFO L87 Difference]: Start difference. First operand 3584 states and 4561 transitions. Second operand 10 states. [2020-12-23 11:42:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:37,565 INFO L93 Difference]: Finished difference Result 7756 states and 9846 transitions. [2020-12-23 11:42:37,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 11:42:37,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 136 [2020-12-23 11:42:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:37,571 INFO L225 Difference]: With dead ends: 7756 [2020-12-23 11:42:37,571 INFO L226 Difference]: Without dead ends: 4982 [2020-12-23 11:42:37,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-12-23 11:42:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4982 states. [2020-12-23 11:42:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4982 to 3240. [2020-12-23 11:42:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3240 states. [2020-12-23 11:42:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 4126 transitions. [2020-12-23 11:42:37,682 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 4126 transitions. Word has length 136 [2020-12-23 11:42:37,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:37,682 INFO L481 AbstractCegarLoop]: Abstraction has 3240 states and 4126 transitions. [2020-12-23 11:42:37,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:42:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 4126 transitions. [2020-12-23 11:42:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-12-23 11:42:37,685 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:37,685 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:42:37,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 11:42:37,685 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:37,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1360392325, now seen corresponding path program 1 times [2020-12-23 11:42:37,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:37,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703401678] [2020-12-23 11:42:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:42:39,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703401678] [2020-12-23 11:42:39,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:39,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 11:42:39,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568993720] [2020-12-23 11:42:39,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 11:42:39,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:39,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 11:42:39,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-12-23 11:42:39,162 INFO L87 Difference]: Start difference. First operand 3240 states and 4126 transitions. Second operand 11 states. [2020-12-23 11:42:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:42,979 INFO L93 Difference]: Finished difference Result 5922 states and 7433 transitions. [2020-12-23 11:42:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 11:42:42,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2020-12-23 11:42:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:42,983 INFO L225 Difference]: With dead ends: 5922 [2020-12-23 11:42:42,983 INFO L226 Difference]: Without dead ends: 3744 [2020-12-23 11:42:42,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-12-23 11:42:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2020-12-23 11:42:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 2512. [2020-12-23 11:42:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2512 states. [2020-12-23 11:42:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 3170 transitions. [2020-12-23 11:42:43,109 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 3170 transitions. Word has length 139 [2020-12-23 11:42:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:43,110 INFO L481 AbstractCegarLoop]: Abstraction has 2512 states and 3170 transitions. [2020-12-23 11:42:43,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 11:42:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 3170 transitions. [2020-12-23 11:42:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 11:42:43,113 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:43,113 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:42:43,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 11:42:43,114 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:43,114 INFO L82 PathProgramCache]: Analyzing trace with hash 490526903, now seen corresponding path program 1 times [2020-12-23 11:42:43,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:43,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188449477] [2020-12-23 11:42:43,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:49,941 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-12-23 11:42:50,107 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-12-23 11:42:50,358 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2020-12-23 11:42:50,622 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2020-12-23 11:42:50,970 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2020-12-23 11:42:51,358 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-12-23 11:42:51,727 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2020-12-23 11:42:52,075 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2020-12-23 11:42:52,528 WARN L197 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 74 [2020-12-23 11:42:52,827 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2020-12-23 11:42:53,042 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-12-23 11:42:53,230 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-12-23 11:42:53,392 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-12-23 11:42:53,552 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-12-23 11:42:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 11:42:53,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188449477] [2020-12-23 11:42:53,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:53,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-23 11:42:53,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9534674] [2020-12-23 11:42:53,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 11:42:53,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:53,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 11:42:53,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-12-23 11:42:53,800 INFO L87 Difference]: Start difference. First operand 2512 states and 3170 transitions. Second operand 17 states. [2020-12-23 11:43:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:43:03,219 INFO L93 Difference]: Finished difference Result 3260 states and 4079 transitions. [2020-12-23 11:43:03,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 11:43:03,220 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 140 [2020-12-23 11:43:03,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:43:03,223 INFO L225 Difference]: With dead ends: 3260 [2020-12-23 11:43:03,223 INFO L226 Difference]: Without dead ends: 2841 [2020-12-23 11:43:03,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2020-12-23 11:43:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2020-12-23 11:43:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2542. [2020-12-23 11:43:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2020-12-23 11:43:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 3203 transitions. [2020-12-23 11:43:03,340 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 3203 transitions. Word has length 140 [2020-12-23 11:43:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:43:03,340 INFO L481 AbstractCegarLoop]: Abstraction has 2542 states and 3203 transitions. [2020-12-23 11:43:03,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 11:43:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3203 transitions. [2020-12-23 11:43:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-23 11:43:03,343 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:43:03,343 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-12-23 11:43:03,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 11:43:03,344 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:43:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:43:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1529816759, now seen corresponding path program 1 times [2020-12-23 11:43:03,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:43:03,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771018691] [2020-12-23 11:43:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY