/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-178dd20 [2021-01-06 21:31:32,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:31:32,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:31:32,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:31:32,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:31:32,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:31:32,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:31:32,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:31:32,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:31:32,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:31:32,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:31:32,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:31:32,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:31:32,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:31:32,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:31:32,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:31:32,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:31:32,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:31:32,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:31:32,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:31:32,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:31:32,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:31:32,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:31:32,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:31:32,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:31:32,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:31:32,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:31:32,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:31:32,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:31:32,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:31:32,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:31:32,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:31:32,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:31:32,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:31:32,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:31:32,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:31:32,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:31:32,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:31:32,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:31:32,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:31:32,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:31:32,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 21:31:32,664 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:31:32,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:31:32,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:31:32,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:31:32,667 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:31:32,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:31:32,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:31:32,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:31:32,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:31:32,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:31:32,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:31:32,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:31:32,669 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:31:32,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:31:32,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:31:32,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:31:32,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:31:32,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:31:32,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:31:32,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:31:32,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:31:32,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:31:32,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:31:32,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:31:32,671 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:31:32,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 21:31:33,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:31:33,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:31:33,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:31:33,112 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:31:33,115 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:31:33,117 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 [2021-01-06 21:31:33,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c1b19e5fe/bc166785dece4a13a44dd247445ce741/FLAG308cf4111 [2021-01-06 21:31:33,926 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:31:33,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_read_write_lock-1.i [2021-01-06 21:31:33,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c1b19e5fe/bc166785dece4a13a44dd247445ce741/FLAG308cf4111 [2021-01-06 21:31:34,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c1b19e5fe/bc166785dece4a13a44dd247445ce741 [2021-01-06 21:31:34,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:31:34,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:31:34,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:31:34,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:31:34,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:31:34,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:31:34" (1/1) ... [2021-01-06 21:31:34,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b16540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:34, skipping insertion in model container [2021-01-06 21:31:34,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:31:34" (1/1) ... [2021-01-06 21:31:34,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:31:34,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 21:31:34,851 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]]] [2021-01-06 21:31:35,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:31:35,140 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 21:31:35,201 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]]]]]]] [2021-01-06 21:31:35,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:31:35,473 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:31:35,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35 WrapperNode [2021-01-06 21:31:35,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:31:35,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:31:35,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:31:35,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:31:35,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35" (1/1) ... [2021-01-06 21:31:35,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35" (1/1) ... [2021-01-06 21:31:35,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:31:35,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:31:35,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:31:35,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:31:35,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35" (1/1) ... [2021-01-06 21:31:35,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35" (1/1) ... [2021-01-06 21:31:35,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35" (1/1) ... [2021-01-06 21:31:35,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35" (1/1) ... [2021-01-06 21:31:35,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35" (1/1) ... [2021-01-06 21:31:35,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35" (1/1) ... [2021-01-06 21:31:36,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35" (1/1) ... [2021-01-06 21:31:36,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:31:36,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:31:36,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:31:36,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:31:36,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:31:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 21:31:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 21:31:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 21:31:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:31:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 21:31:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 21:31:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:31:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:31:36,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:31:36,581 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:36,608 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:36,626 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:36,638 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:36,647 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:42,167 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##647: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:31:42,167 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##646: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:31:42,168 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; [2021-01-06 21:31:42,168 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; [2021-01-06 21:31:42,168 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; [2021-01-06 21:31:42,168 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; [2021-01-06 21:31:42,168 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; [2021-01-06 21:31:42,169 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1114: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:31:42,169 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1115: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:31:42,169 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-14: assume 0 != ~__CS_ret~0 % 256;reader_#res.base, reader_#res.offset := 0, 0; [2021-01-06 21:31:42,169 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-14: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:42,169 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-36: assume 0 != ~__CS_ret~0 % 256;reader_#res.base, reader_#res.offset := 0, 0; [2021-01-06 21:31:42,170 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-36: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:42,170 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-58: assume 0 != ~__CS_ret~0 % 256;reader_#res.base, reader_#res.offset := 0, 0; [2021-01-06 21:31:42,170 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-58: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:42,170 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##412: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:31:42,170 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-80: assume 0 != ~__CS_ret~0 % 256;reader_#res.base, reader_#res.offset := 0, 0; [2021-01-06 21:31:42,171 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-80: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:42,171 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##413: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:31:42,171 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-102: assume 0 != ~__CS_ret~0 % 256;reader_#res.base, reader_#res.offset := 0, 0; [2021-01-06 21:31:42,171 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-102: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:42,171 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; [2021-01-06 21:31:42,171 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; [2021-01-06 21:31:42,172 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; [2021-01-06 21:31:42,172 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; [2021-01-06 21:31:42,172 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; [2021-01-06 21:31:42,172 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; [2021-01-06 21:31:42,172 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##881: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:31:42,172 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##880: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:31:42,173 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; [2021-01-06 21:31:42,173 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; [2021-01-06 21:31:42,173 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; [2021-01-06 21:31:42,173 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; [2021-01-06 21:31:42,173 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; [2021-01-06 21:31:42,174 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; [2021-01-06 21:31:42,174 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; [2021-01-06 21:31:42,174 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; [2021-01-06 21:31:42,174 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; [2021-01-06 21:31:42,174 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##179: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:31:42,175 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##178: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:31:43,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:31:43,255 INFO L299 CfgBuilder]: Removed 636 assume(true) statements. [2021-01-06 21:31:43,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:31:43 BoogieIcfgContainer [2021-01-06 21:31:43,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:31:43,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:31:43,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:31:43,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:31:43,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:31:34" (1/3) ... [2021-01-06 21:31:43,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce33a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:31:43, skipping insertion in model container [2021-01-06 21:31:43,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:35" (2/3) ... [2021-01-06 21:31:43,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce33a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:31:43, skipping insertion in model container [2021-01-06 21:31:43,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:31:43" (3/3) ... [2021-01-06 21:31:43,269 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_read_write_lock-1.i [2021-01-06 21:31:43,276 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:31:43,283 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:31:43,305 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:31:43,338 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:31:43,338 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:31:43,338 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:31:43,339 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:31:43,339 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:31:43,339 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:31:43,339 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:31:43,339 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:31:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states. [2021-01-06 21:31:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 21:31:43,391 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:43,392 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] [2021-01-06 21:31:43,393 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:43,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:43,400 INFO L82 PathProgramCache]: Analyzing trace with hash 537209623, now seen corresponding path program 1 times [2021-01-06 21:31:43,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:43,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538223279] [2021-01-06 21:31:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:31:43,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538223279] [2021-01-06 21:31:43,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:43,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:31:43,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80235041] [2021-01-06 21:31:43,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:31:43,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:43,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:31:43,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:31:43,847 INFO L87 Difference]: Start difference. First operand 847 states. Second operand 3 states. [2021-01-06 21:31:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:44,073 INFO L93 Difference]: Finished difference Result 1696 states and 2666 transitions. [2021-01-06 21:31:44,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:31:44,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 21:31:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:44,100 INFO L225 Difference]: With dead ends: 1696 [2021-01-06 21:31:44,101 INFO L226 Difference]: Without dead ends: 847 [2021-01-06 21:31:44,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:31:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-01-06 21:31:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2021-01-06 21:31:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2021-01-06 21:31:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1185 transitions. [2021-01-06 21:31:44,234 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1185 transitions. Word has length 44 [2021-01-06 21:31:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:44,234 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1185 transitions. [2021-01-06 21:31:44,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:31:44,235 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1185 transitions. [2021-01-06 21:31:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 21:31:44,238 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:44,238 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] [2021-01-06 21:31:44,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:31:44,241 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:44,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:44,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1478100181, now seen corresponding path program 1 times [2021-01-06 21:31:44,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:44,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111494433] [2021-01-06 21:31:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:31:44,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111494433] [2021-01-06 21:31:44,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:44,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:31:44,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333943791] [2021-01-06 21:31:44,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:31:44,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:44,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:31:44,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:31:44,407 INFO L87 Difference]: Start difference. First operand 844 states and 1185 transitions. Second operand 3 states. [2021-01-06 21:31:44,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:44,457 INFO L93 Difference]: Finished difference Result 1687 states and 2370 transitions. [2021-01-06 21:31:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:31:44,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2021-01-06 21:31:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:44,471 INFO L225 Difference]: With dead ends: 1687 [2021-01-06 21:31:44,471 INFO L226 Difference]: Without dead ends: 846 [2021-01-06 21:31:44,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:31:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-01-06 21:31:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 845. [2021-01-06 21:31:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2021-01-06 21:31:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1186 transitions. [2021-01-06 21:31:44,503 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1186 transitions. Word has length 47 [2021-01-06 21:31:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:44,504 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1186 transitions. [2021-01-06 21:31:44,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:31:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1186 transitions. [2021-01-06 21:31:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 21:31:44,509 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:44,509 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] [2021-01-06 21:31:44,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:31:44,509 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:44,512 INFO L82 PathProgramCache]: Analyzing trace with hash 199242925, now seen corresponding path program 1 times [2021-01-06 21:31:44,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:44,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870206552] [2021-01-06 21:31:44,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:31:44,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870206552] [2021-01-06 21:31:44,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066969383] [2021-01-06 21:31:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:44,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 21:31:44,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:31:45,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 21:31:45,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 21:31:45,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820694846] [2021-01-06 21:31:45,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:31:45,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:45,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:31:45,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:31:45,085 INFO L87 Difference]: Start difference. First operand 845 states and 1186 transitions. Second operand 5 states. [2021-01-06 21:31:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:45,156 INFO L93 Difference]: Finished difference Result 1690 states and 2373 transitions. [2021-01-06 21:31:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:31:45,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2021-01-06 21:31:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:45,165 INFO L225 Difference]: With dead ends: 1690 [2021-01-06 21:31:45,165 INFO L226 Difference]: Without dead ends: 848 [2021-01-06 21:31:45,167 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 [2021-01-06 21:31:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2021-01-06 21:31:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 847. [2021-01-06 21:31:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2021-01-06 21:31:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1188 transitions. [2021-01-06 21:31:45,197 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1188 transitions. Word has length 49 [2021-01-06 21:31:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:45,197 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 1188 transitions. [2021-01-06 21:31:45,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:31:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1188 transitions. [2021-01-06 21:31:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 21:31:45,201 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:45,201 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] [2021-01-06 21:31:45,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 21:31:45,416 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:45,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:45,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1513231791, now seen corresponding path program 2 times [2021-01-06 21:31:45,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:45,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889885970] [2021-01-06 21:31:45,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 21:31:45,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889885970] [2021-01-06 21:31:45,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670441606] [2021-01-06 21:31:45,574 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 [2021-01-06 21:31:46,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 21:31:46,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 21:31:46,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 21:31:46,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 21:31:46,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 21:31:46,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 21:31:46,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596371880] [2021-01-06 21:31:46,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:31:46,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:46,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:31:46,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:31:46,248 INFO L87 Difference]: Start difference. First operand 847 states and 1188 transitions. Second operand 3 states. [2021-01-06 21:31:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:46,277 INFO L93 Difference]: Finished difference Result 1523 states and 2135 transitions. [2021-01-06 21:31:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:31:46,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2021-01-06 21:31:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:46,282 INFO L225 Difference]: With dead ends: 1523 [2021-01-06 21:31:46,283 INFO L226 Difference]: Without dead ends: 847 [2021-01-06 21:31:46,284 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 [2021-01-06 21:31:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-01-06 21:31:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2021-01-06 21:31:46,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2021-01-06 21:31:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1187 transitions. [2021-01-06 21:31:46,305 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1187 transitions. Word has length 51 [2021-01-06 21:31:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:46,306 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 1187 transitions. [2021-01-06 21:31:46,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:31:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1187 transitions. [2021-01-06 21:31:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 21:31:46,308 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:46,308 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] [2021-01-06 21:31:46,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:46,522 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:46,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:46,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1900458601, now seen corresponding path program 1 times [2021-01-06 21:31:46,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:46,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094071833] [2021-01-06 21:31:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 21:31:46,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094071833] [2021-01-06 21:31:46,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099240573] [2021-01-06 21:31:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:46,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 21:31:46,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:31:46,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 21:31:46,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2021-01-06 21:31:46,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246435159] [2021-01-06 21:31:46,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 21:31:46,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:46,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 21:31:46,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:31:46,980 INFO L87 Difference]: Start difference. First operand 847 states and 1187 transitions. Second operand 7 states. [2021-01-06 21:31:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:47,195 INFO L93 Difference]: Finished difference Result 1704 states and 2388 transitions. [2021-01-06 21:31:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:31:47,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2021-01-06 21:31:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:47,201 INFO L225 Difference]: With dead ends: 1704 [2021-01-06 21:31:47,201 INFO L226 Difference]: Without dead ends: 860 [2021-01-06 21:31:47,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:31:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2021-01-06 21:31:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 858. [2021-01-06 21:31:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2021-01-06 21:31:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1199 transitions. [2021-01-06 21:31:47,224 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1199 transitions. Word has length 61 [2021-01-06 21:31:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:47,225 INFO L481 AbstractCegarLoop]: Abstraction has 858 states and 1199 transitions. [2021-01-06 21:31:47,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 21:31:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1199 transitions. [2021-01-06 21:31:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 21:31:47,227 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:47,227 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] [2021-01-06 21:31:47,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:47,443 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1980991783, now seen corresponding path program 2 times [2021-01-06 21:31:47,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:47,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619737697] [2021-01-06 21:31:47,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 21:31:47,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619737697] [2021-01-06 21:31:47,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317176684] [2021-01-06 21:31:47,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:47,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 21:31:47,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 21:31:47,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 21:31:48,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:31:48,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 21:31:48,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-01-06 21:31:48,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318055172] [2021-01-06 21:31:48,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:31:48,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:48,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:31:48,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:31:48,157 INFO L87 Difference]: Start difference. First operand 858 states and 1199 transitions. Second operand 6 states. [2021-01-06 21:31:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:51,975 INFO L93 Difference]: Finished difference Result 2056 states and 2860 transitions. [2021-01-06 21:31:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 21:31:51,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2021-01-06 21:31:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:51,983 INFO L225 Difference]: With dead ends: 2056 [2021-01-06 21:31:51,983 INFO L226 Difference]: Without dead ends: 1238 [2021-01-06 21:31:51,985 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 [2021-01-06 21:31:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2021-01-06 21:31:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1178. [2021-01-06 21:31:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2021-01-06 21:31:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1539 transitions. [2021-01-06 21:31:52,021 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1539 transitions. Word has length 72 [2021-01-06 21:31:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:52,022 INFO L481 AbstractCegarLoop]: Abstraction has 1178 states and 1539 transitions. [2021-01-06 21:31:52,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:31:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1539 transitions. [2021-01-06 21:31:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 21:31:52,025 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:52,026 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] [2021-01-06 21:31:52,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:52,242 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:52,242 INFO L82 PathProgramCache]: Analyzing trace with hash 609184485, now seen corresponding path program 1 times [2021-01-06 21:31:52,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:52,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322546130] [2021-01-06 21:31:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 21:31:52,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322546130] [2021-01-06 21:31:52,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119675058] [2021-01-06 21:31:52,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:52,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 21:31:52,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 21:31:52,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 21:31:52,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-01-06 21:31:52,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125127739] [2021-01-06 21:31:52,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 21:31:52,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:52,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 21:31:52,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:31:52,829 INFO L87 Difference]: Start difference. First operand 1178 states and 1539 transitions. Second operand 7 states. [2021-01-06 21:31:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:52,941 INFO L93 Difference]: Finished difference Result 2352 states and 3075 transitions. [2021-01-06 21:31:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:31:52,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2021-01-06 21:31:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:52,948 INFO L225 Difference]: With dead ends: 2352 [2021-01-06 21:31:52,949 INFO L226 Difference]: Without dead ends: 1184 [2021-01-06 21:31:52,951 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 [2021-01-06 21:31:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2021-01-06 21:31:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1182. [2021-01-06 21:31:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2021-01-06 21:31:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1543 transitions. [2021-01-06 21:31:52,984 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1543 transitions. Word has length 72 [2021-01-06 21:31:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:52,984 INFO L481 AbstractCegarLoop]: Abstraction has 1182 states and 1543 transitions. [2021-01-06 21:31:52,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 21:31:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1543 transitions. [2021-01-06 21:31:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 21:31:52,987 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:52,987 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] [2021-01-06 21:31:53,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-06 21:31:53,201 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash -573760987, now seen corresponding path program 2 times [2021-01-06 21:31:53,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:53,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589936640] [2021-01-06 21:31:53,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 21:31:53,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589936640] [2021-01-06 21:31:53,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018368635] [2021-01-06 21:31:53,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:53,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 21:31:53,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 21:31:53,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 21:31:53,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-01-06 21:31:54,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 21:31:54,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2021-01-06 21:31:54,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940427797] [2021-01-06 21:31:54,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:31:54,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:31:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:31:54,084 INFO L87 Difference]: Start difference. First operand 1182 states and 1543 transitions. Second operand 4 states. [2021-01-06 21:31:54,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:54,333 INFO L93 Difference]: Finished difference Result 2185 states and 2857 transitions. [2021-01-06 21:31:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:31:54,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 21:31:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:54,344 INFO L225 Difference]: With dead ends: 2185 [2021-01-06 21:31:54,345 INFO L226 Difference]: Without dead ends: 2036 [2021-01-06 21:31:54,346 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 [2021-01-06 21:31:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2021-01-06 21:31:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 2032. [2021-01-06 21:31:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2021-01-06 21:31:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2650 transitions. [2021-01-06 21:31:54,407 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2650 transitions. Word has length 76 [2021-01-06 21:31:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:54,407 INFO L481 AbstractCegarLoop]: Abstraction has 2032 states and 2650 transitions. [2021-01-06 21:31:54,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:31:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2650 transitions. [2021-01-06 21:31:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 21:31:54,412 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:54,412 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] [2021-01-06 21:31:54,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:54,626 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash 547507605, now seen corresponding path program 1 times [2021-01-06 21:31:54,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:54,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806983544] [2021-01-06 21:31:54,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-01-06 21:31:54,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806983544] [2021-01-06 21:31:54,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:54,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:31:54,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985038789] [2021-01-06 21:31:54,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:31:54,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:54,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:31:54,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:31:54,917 INFO L87 Difference]: Start difference. First operand 2032 states and 2650 transitions. Second operand 4 states. [2021-01-06 21:31:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:55,625 INFO L93 Difference]: Finished difference Result 5820 states and 7566 transitions. [2021-01-06 21:31:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:31:55,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2021-01-06 21:31:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:55,653 INFO L225 Difference]: With dead ends: 5820 [2021-01-06 21:31:55,654 INFO L226 Difference]: Without dead ends: 4033 [2021-01-06 21:31:55,661 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 [2021-01-06 21:31:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2021-01-06 21:31:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 1965. [2021-01-06 21:31:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2021-01-06 21:31:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2564 transitions. [2021-01-06 21:31:55,770 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2564 transitions. Word has length 103 [2021-01-06 21:31:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:55,772 INFO L481 AbstractCegarLoop]: Abstraction has 1965 states and 2564 transitions. [2021-01-06 21:31:55,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:31:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2564 transitions. [2021-01-06 21:31:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-06 21:31:55,778 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:55,778 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] [2021-01-06 21:31:55,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:31:55,779 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash -318130092, now seen corresponding path program 1 times [2021-01-06 21:31:55,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:55,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766010936] [2021-01-06 21:31:55,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-01-06 21:31:56,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766010936] [2021-01-06 21:31:56,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:56,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:31:56,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218677683] [2021-01-06 21:31:56,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:31:56,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:56,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:31:56,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:31:56,053 INFO L87 Difference]: Start difference. First operand 1965 states and 2564 transitions. Second operand 3 states. [2021-01-06 21:31:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:58,641 INFO L93 Difference]: Finished difference Result 5748 states and 7512 transitions. [2021-01-06 21:31:58,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:31:58,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2021-01-06 21:31:58,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:58,662 INFO L225 Difference]: With dead ends: 5748 [2021-01-06 21:31:58,662 INFO L226 Difference]: Without dead ends: 3861 [2021-01-06 21:31:58,667 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:31:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2021-01-06 21:31:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3557. [2021-01-06 21:31:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3557 states. [2021-01-06 21:31:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4636 transitions. [2021-01-06 21:31:58,778 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4636 transitions. Word has length 111 [2021-01-06 21:31:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:58,779 INFO L481 AbstractCegarLoop]: Abstraction has 3557 states and 4636 transitions. [2021-01-06 21:31:58,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:31:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4636 transitions. [2021-01-06 21:31:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-06 21:31:58,788 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:58,788 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] [2021-01-06 21:31:58,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:31:58,788 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:58,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:58,789 INFO L82 PathProgramCache]: Analyzing trace with hash -263737194, now seen corresponding path program 1 times [2021-01-06 21:31:58,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:58,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651683411] [2021-01-06 21:31:58,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 21:31:58,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651683411] [2021-01-06 21:31:58,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153726410] [2021-01-06 21:31:58,985 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 [2021-01-06 21:31:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:59,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 21:31:59,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 21:31:59,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 21:31:59,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-01-06 21:31:59,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167565075] [2021-01-06 21:31:59,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 21:31:59,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 21:31:59,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:31:59,510 INFO L87 Difference]: Start difference. First operand 3557 states and 4636 transitions. Second operand 8 states. [2021-01-06 21:31:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:59,697 INFO L93 Difference]: Finished difference Result 7106 states and 9265 transitions. [2021-01-06 21:31:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 21:31:59,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2021-01-06 21:31:59,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:59,719 INFO L225 Difference]: With dead ends: 7106 [2021-01-06 21:31:59,719 INFO L226 Difference]: Without dead ends: 3561 [2021-01-06 21:31:59,728 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 [2021-01-06 21:31:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2021-01-06 21:31:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3561. [2021-01-06 21:31:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2021-01-06 21:31:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 4640 transitions. [2021-01-06 21:31:59,853 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 4640 transitions. Word has length 111 [2021-01-06 21:31:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:59,853 INFO L481 AbstractCegarLoop]: Abstraction has 3561 states and 4640 transitions. [2021-01-06 21:31:59,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 21:31:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 4640 transitions. [2021-01-06 21:31:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-01-06 21:31:59,868 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:59,868 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] [2021-01-06 21:32:00,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:32:00,082 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1528674390, now seen corresponding path program 2 times [2021-01-06 21:32:00,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:00,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988597070] [2021-01-06 21:32:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:32:00,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988597070] [2021-01-06 21:32:00,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:00,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:32:00,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110647237] [2021-01-06 21:32:00,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:32:00,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:00,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:32:00,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:32:00,384 INFO L87 Difference]: Start difference. First operand 3561 states and 4640 transitions. Second operand 3 states. [2021-01-06 21:32:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:00,842 INFO L93 Difference]: Finished difference Result 6238 states and 8066 transitions. [2021-01-06 21:32:00,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:32:00,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2021-01-06 21:32:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:00,866 INFO L225 Difference]: With dead ends: 6238 [2021-01-06 21:32:00,866 INFO L226 Difference]: Without dead ends: 4342 [2021-01-06 21:32:00,871 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 [2021-01-06 21:32:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2021-01-06 21:32:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 4170. [2021-01-06 21:32:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4170 states. [2021-01-06 21:32:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 5413 transitions. [2021-01-06 21:32:00,999 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 5413 transitions. Word has length 115 [2021-01-06 21:32:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:01,000 INFO L481 AbstractCegarLoop]: Abstraction has 4170 states and 5413 transitions. [2021-01-06 21:32:01,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:32:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5413 transitions. [2021-01-06 21:32:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-01-06 21:32:01,010 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:01,010 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] [2021-01-06 21:32:01,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:32:01,011 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:01,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:01,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1927259244, now seen corresponding path program 1 times [2021-01-06 21:32:01,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:01,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861093926] [2021-01-06 21:32:01,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:32:01,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861093926] [2021-01-06 21:32:01,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:01,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:32:01,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251627275] [2021-01-06 21:32:01,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:32:01,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:01,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:32:01,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:32:01,226 INFO L87 Difference]: Start difference. First operand 4170 states and 5413 transitions. Second operand 4 states. [2021-01-06 21:32:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:02,054 INFO L93 Difference]: Finished difference Result 7071 states and 9108 transitions. [2021-01-06 21:32:02,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:32:02,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2021-01-06 21:32:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:02,082 INFO L225 Difference]: With dead ends: 7071 [2021-01-06 21:32:02,083 INFO L226 Difference]: Without dead ends: 5184 [2021-01-06 21:32:02,087 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 [2021-01-06 21:32:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5184 states. [2021-01-06 21:32:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5184 to 4838. [2021-01-06 21:32:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4838 states. [2021-01-06 21:32:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 6257 transitions. [2021-01-06 21:32:02,236 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 6257 transitions. Word has length 115 [2021-01-06 21:32:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:02,237 INFO L481 AbstractCegarLoop]: Abstraction has 4838 states and 6257 transitions. [2021-01-06 21:32:02,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:32:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 6257 transitions. [2021-01-06 21:32:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-01-06 21:32:02,249 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:02,249 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] [2021-01-06 21:32:02,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:32:02,250 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1345964500, now seen corresponding path program 1 times [2021-01-06 21:32:02,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:02,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108254492] [2021-01-06 21:32:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:32:02,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108254492] [2021-01-06 21:32:02,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:02,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 21:32:02,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135194265] [2021-01-06 21:32:02,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:32:02,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:02,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:32:02,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:32:02,532 INFO L87 Difference]: Start difference. First operand 4838 states and 6257 transitions. Second operand 6 states. [2021-01-06 21:32:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:08,162 INFO L93 Difference]: Finished difference Result 8561 states and 10961 transitions. [2021-01-06 21:32:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:32:08,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2021-01-06 21:32:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:08,180 INFO L225 Difference]: With dead ends: 8561 [2021-01-06 21:32:08,181 INFO L226 Difference]: Without dead ends: 6683 [2021-01-06 21:32:08,186 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 [2021-01-06 21:32:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2021-01-06 21:32:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 5983. [2021-01-06 21:32:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5983 states. [2021-01-06 21:32:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 7675 transitions. [2021-01-06 21:32:08,335 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 7675 transitions. Word has length 115 [2021-01-06 21:32:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:08,336 INFO L481 AbstractCegarLoop]: Abstraction has 5983 states and 7675 transitions. [2021-01-06 21:32:08,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:32:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 7675 transitions. [2021-01-06 21:32:08,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-01-06 21:32:08,348 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:08,348 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] [2021-01-06 21:32:08,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:32:08,349 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:08,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:08,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1688085546, now seen corresponding path program 1 times [2021-01-06 21:32:08,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:08,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30780165] [2021-01-06 21:32:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:13,626 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2021-01-06 21:32:13,926 WARN L197 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 98 [2021-01-06 21:32:14,349 WARN L197 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 114 [2021-01-06 21:32:14,602 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2021-01-06 21:32:14,900 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 73 [2021-01-06 21:32:15,219 WARN L197 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 78 [2021-01-06 21:32:15,583 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 76 [2021-01-06 21:32:16,097 WARN L197 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 75 [2021-01-06 21:32:16,544 WARN L197 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 74 [2021-01-06 21:32:17,031 WARN L197 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 79 [2021-01-06 21:32:17,243 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2021-01-06 21:32:17,577 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2021-01-06 21:32:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:32:17,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30780165] [2021-01-06 21:32:17,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:17,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 21:32:17,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141277452] [2021-01-06 21:32:17,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 21:32:17,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:17,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 21:32:17,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:32:17,852 INFO L87 Difference]: Start difference. First operand 5983 states and 7675 transitions. Second operand 15 states. [2021-01-06 21:32:21,231 WARN L197 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 122 [2021-01-06 21:32:21,892 WARN L197 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 128 [2021-01-06 21:32:22,631 WARN L197 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 130 [2021-01-06 21:32:23,505 WARN L197 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 139 [2021-01-06 21:32:24,326 WARN L197 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 142 [2021-01-06 21:32:26,029 WARN L197 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 131 [2021-01-06 21:32:28,447 WARN L197 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 139 [2021-01-06 21:32:29,330 WARN L197 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 115 [2021-01-06 21:32:31,389 WARN L197 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 124 [2021-01-06 21:32:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:42,162 INFO L93 Difference]: Finished difference Result 9925 states and 12805 transitions. [2021-01-06 21:32:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:32:42,164 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2021-01-06 21:32:42,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:42,185 INFO L225 Difference]: With dead ends: 9925 [2021-01-06 21:32:42,185 INFO L226 Difference]: Without dead ends: 8328 [2021-01-06 21:32:42,189 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 [2021-01-06 21:32:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2021-01-06 21:32:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 6241. [2021-01-06 21:32:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2021-01-06 21:32:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 7994 transitions. [2021-01-06 21:32:42,416 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 7994 transitions. Word has length 115 [2021-01-06 21:32:42,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:42,416 INFO L481 AbstractCegarLoop]: Abstraction has 6241 states and 7994 transitions. [2021-01-06 21:32:42,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 21:32:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 7994 transitions. [2021-01-06 21:32:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:32:42,429 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:42,430 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] [2021-01-06 21:32:42,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:32:42,430 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:42,431 INFO L82 PathProgramCache]: Analyzing trace with hash 187208037, now seen corresponding path program 1 times [2021-01-06 21:32:42,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:42,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844216884] [2021-01-06 21:32:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:32:42,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844216884] [2021-01-06 21:32:42,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:42,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:32:42,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022972035] [2021-01-06 21:32:42,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:32:42,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:42,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:32:42,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:32:42,640 INFO L87 Difference]: Start difference. First operand 6241 states and 7994 transitions. Second operand 4 states. [2021-01-06 21:32:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:45,257 INFO L93 Difference]: Finished difference Result 6615 states and 8436 transitions. [2021-01-06 21:32:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:32:45,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2021-01-06 21:32:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:45,271 INFO L225 Difference]: With dead ends: 6615 [2021-01-06 21:32:45,271 INFO L226 Difference]: Without dead ends: 6145 [2021-01-06 21:32:45,274 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 [2021-01-06 21:32:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6145 states. [2021-01-06 21:32:45,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6145 to 6037. [2021-01-06 21:32:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6037 states. [2021-01-06 21:32:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6037 states to 6037 states and 7738 transitions. [2021-01-06 21:32:45,442 INFO L78 Accepts]: Start accepts. Automaton has 6037 states and 7738 transitions. Word has length 117 [2021-01-06 21:32:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:45,442 INFO L481 AbstractCegarLoop]: Abstraction has 6037 states and 7738 transitions. [2021-01-06 21:32:45,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:32:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6037 states and 7738 transitions. [2021-01-06 21:32:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:32:45,453 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:45,454 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] [2021-01-06 21:32:45,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:32:45,454 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash -118382953, now seen corresponding path program 1 times [2021-01-06 21:32:45,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:45,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103896336] [2021-01-06 21:32:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:32:45,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103896336] [2021-01-06 21:32:45,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:45,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:32:45,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016392483] [2021-01-06 21:32:45,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:32:45,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:45,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:32:45,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:32:45,654 INFO L87 Difference]: Start difference. First operand 6037 states and 7738 transitions. Second operand 4 states. [2021-01-06 21:32:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:48,188 INFO L93 Difference]: Finished difference Result 6877 states and 8771 transitions. [2021-01-06 21:32:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:32:48,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2021-01-06 21:32:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:48,202 INFO L225 Difference]: With dead ends: 6877 [2021-01-06 21:32:48,202 INFO L226 Difference]: Without dead ends: 5829 [2021-01-06 21:32:48,206 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 [2021-01-06 21:32:48,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5829 states. [2021-01-06 21:32:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5829 to 5719. [2021-01-06 21:32:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5719 states. [2021-01-06 21:32:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 7334 transitions. [2021-01-06 21:32:48,436 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 7334 transitions. Word has length 117 [2021-01-06 21:32:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:48,437 INFO L481 AbstractCegarLoop]: Abstraction has 5719 states and 7334 transitions. [2021-01-06 21:32:48,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:32:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 7334 transitions. [2021-01-06 21:32:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:32:48,447 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:48,447 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] [2021-01-06 21:32:48,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:32:48,447 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash 598205138, now seen corresponding path program 1 times [2021-01-06 21:32:48,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:48,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388455452] [2021-01-06 21:32:48,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:32:48,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388455452] [2021-01-06 21:32:48,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:48,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:32:48,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508005289] [2021-01-06 21:32:48,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:32:48,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:48,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:32:48,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:32:48,637 INFO L87 Difference]: Start difference. First operand 5719 states and 7334 transitions. Second operand 4 states. [2021-01-06 21:32:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:51,152 INFO L93 Difference]: Finished difference Result 8059 states and 10305 transitions. [2021-01-06 21:32:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:32:51,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2021-01-06 21:32:51,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:51,165 INFO L225 Difference]: With dead ends: 8059 [2021-01-06 21:32:51,166 INFO L226 Difference]: Without dead ends: 5513 [2021-01-06 21:32:51,170 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 [2021-01-06 21:32:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2021-01-06 21:32:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5401. [2021-01-06 21:32:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5401 states. [2021-01-06 21:32:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 6930 transitions. [2021-01-06 21:32:51,334 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 6930 transitions. Word has length 117 [2021-01-06 21:32:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:51,334 INFO L481 AbstractCegarLoop]: Abstraction has 5401 states and 6930 transitions. [2021-01-06 21:32:51,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:32:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 6930 transitions. [2021-01-06 21:32:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:32:51,343 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:51,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] [2021-01-06 21:32:51,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 21:32:51,343 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2031995277, now seen corresponding path program 1 times [2021-01-06 21:32:51,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:51,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299214735] [2021-01-06 21:32:51,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:32:51,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299214735] [2021-01-06 21:32:51,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:51,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:32:51,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462272984] [2021-01-06 21:32:51,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:32:51,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:51,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:32:51,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:32:51,526 INFO L87 Difference]: Start difference. First operand 5401 states and 6930 transitions. Second operand 4 states. [2021-01-06 21:32:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:53,985 INFO L93 Difference]: Finished difference Result 8832 states and 11346 transitions. [2021-01-06 21:32:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:32:53,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2021-01-06 21:32:53,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:53,996 INFO L225 Difference]: With dead ends: 8832 [2021-01-06 21:32:53,997 INFO L226 Difference]: Without dead ends: 5153 [2021-01-06 21:32:54,002 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 [2021-01-06 21:32:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2021-01-06 21:32:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 5153. [2021-01-06 21:32:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2021-01-06 21:32:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 6630 transitions. [2021-01-06 21:32:54,157 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 6630 transitions. Word has length 117 [2021-01-06 21:32:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:54,157 INFO L481 AbstractCegarLoop]: Abstraction has 5153 states and 6630 transitions. [2021-01-06 21:32:54,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:32:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 6630 transitions. [2021-01-06 21:32:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 21:32:54,168 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:54,168 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] [2021-01-06 21:32:54,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 21:32:54,168 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:54,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:54,169 INFO L82 PathProgramCache]: Analyzing trace with hash 211353689, now seen corresponding path program 1 times [2021-01-06 21:32:54,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:54,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369771125] [2021-01-06 21:32:54,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:32:54,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369771125] [2021-01-06 21:32:54,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:54,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:32:54,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741416069] [2021-01-06 21:32:54,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:32:54,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:54,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:32:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:32:54,316 INFO L87 Difference]: Start difference. First operand 5153 states and 6630 transitions. Second operand 3 states. [2021-01-06 21:32:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:54,749 INFO L93 Difference]: Finished difference Result 8258 states and 10720 transitions. [2021-01-06 21:32:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:32:54,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2021-01-06 21:32:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:54,765 INFO L225 Difference]: With dead ends: 8258 [2021-01-06 21:32:54,765 INFO L226 Difference]: Without dead ends: 5212 [2021-01-06 21:32:54,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:32:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2021-01-06 21:32:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 5212. [2021-01-06 21:32:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5212 states. [2021-01-06 21:32:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 6685 transitions. [2021-01-06 21:32:54,950 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 6685 transitions. Word has length 118 [2021-01-06 21:32:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:54,951 INFO L481 AbstractCegarLoop]: Abstraction has 5212 states and 6685 transitions. [2021-01-06 21:32:54,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:32:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 6685 transitions. [2021-01-06 21:32:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 21:32:54,964 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:54,965 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] [2021-01-06 21:32:54,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 21:32:54,965 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:54,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1749693719, now seen corresponding path program 1 times [2021-01-06 21:32:54,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:54,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236333441] [2021-01-06 21:32:54,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:05,185 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2021-01-06 21:33:05,368 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2021-01-06 21:33:05,557 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2021-01-06 21:33:05,742 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2021-01-06 21:33:06,051 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-01-06 21:33:06,383 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 74 [2021-01-06 21:33:06,699 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2021-01-06 21:33:07,128 WARN L197 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2021-01-06 21:33:07,499 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 67 [2021-01-06 21:33:07,788 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2021-01-06 21:33:07,971 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2021-01-06 21:33:08,164 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-01-06 21:33:08,359 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2021-01-06 21:33:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:33:08,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236333441] [2021-01-06 21:33:08,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:08,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-01-06 21:33:08,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077686385] [2021-01-06 21:33:08,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 21:33:08,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 21:33:08,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-01-06 21:33:08,556 INFO L87 Difference]: Start difference. First operand 5212 states and 6685 transitions. Second operand 16 states. [2021-01-06 21:33:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:23,131 INFO L93 Difference]: Finished difference Result 11181 states and 14334 transitions. [2021-01-06 21:33:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 21:33:23,139 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 118 [2021-01-06 21:33:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:23,152 INFO L225 Difference]: With dead ends: 11181 [2021-01-06 21:33:23,153 INFO L226 Difference]: Without dead ends: 7896 [2021-01-06 21:33:23,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2021-01-06 21:33:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7896 states. [2021-01-06 21:33:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7896 to 5212. [2021-01-06 21:33:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5212 states. [2021-01-06 21:33:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 6680 transitions. [2021-01-06 21:33:23,355 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 6680 transitions. Word has length 118 [2021-01-06 21:33:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:23,356 INFO L481 AbstractCegarLoop]: Abstraction has 5212 states and 6680 transitions. [2021-01-06 21:33:23,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 21:33:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 6680 transitions. [2021-01-06 21:33:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-01-06 21:33:23,369 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:23,369 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] [2021-01-06 21:33:23,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 21:33:23,369 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:23,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:23,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1628460888, now seen corresponding path program 1 times [2021-01-06 21:33:23,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:23,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434039436] [2021-01-06 21:33:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:33:23,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434039436] [2021-01-06 21:33:23,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:23,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:33:23,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711814951] [2021-01-06 21:33:23,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:33:23,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:23,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:33:23,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:33:23,515 INFO L87 Difference]: Start difference. First operand 5212 states and 6680 transitions. Second operand 3 states. [2021-01-06 21:33:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:25,121 INFO L93 Difference]: Finished difference Result 9658 states and 12315 transitions. [2021-01-06 21:33:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:33:25,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2021-01-06 21:33:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:25,130 INFO L225 Difference]: With dead ends: 9658 [2021-01-06 21:33:25,130 INFO L226 Difference]: Without dead ends: 5673 [2021-01-06 21:33:25,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:33:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2021-01-06 21:33:25,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 5212. [2021-01-06 21:33:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5212 states. [2021-01-06 21:33:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 6653 transitions. [2021-01-06 21:33:25,351 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 6653 transitions. Word has length 124 [2021-01-06 21:33:25,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:25,352 INFO L481 AbstractCegarLoop]: Abstraction has 5212 states and 6653 transitions. [2021-01-06 21:33:25,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:33:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 6653 transitions. [2021-01-06 21:33:25,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-01-06 21:33:25,360 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:25,360 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] [2021-01-06 21:33:25,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 21:33:25,360 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:25,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:25,361 INFO L82 PathProgramCache]: Analyzing trace with hash -241675478, now seen corresponding path program 1 times [2021-01-06 21:33:25,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:25,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284619951] [2021-01-06 21:33:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:33:26,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284619951] [2021-01-06 21:33:26,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:26,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:33:26,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57001410] [2021-01-06 21:33:26,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:33:26,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:33:26,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:33:26,097 INFO L87 Difference]: Start difference. First operand 5212 states and 6653 transitions. Second operand 5 states. [2021-01-06 21:33:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:28,935 INFO L93 Difference]: Finished difference Result 9630 states and 12255 transitions. [2021-01-06 21:33:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:33:28,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2021-01-06 21:33:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:28,941 INFO L225 Difference]: With dead ends: 9630 [2021-01-06 21:33:28,942 INFO L226 Difference]: Without dead ends: 5526 [2021-01-06 21:33:28,948 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 [2021-01-06 21:33:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2021-01-06 21:33:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 4983. [2021-01-06 21:33:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2021-01-06 21:33:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 6364 transitions. [2021-01-06 21:33:29,138 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 6364 transitions. Word has length 124 [2021-01-06 21:33:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:29,138 INFO L481 AbstractCegarLoop]: Abstraction has 4983 states and 6364 transitions. [2021-01-06 21:33:29,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:33:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 6364 transitions. [2021-01-06 21:33:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 21:33:29,145 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:29,145 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] [2021-01-06 21:33:29,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 21:33:29,146 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:29,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:29,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2043041219, now seen corresponding path program 1 times [2021-01-06 21:33:29,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:29,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042195217] [2021-01-06 21:33:29,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:33:33,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042195217] [2021-01-06 21:33:33,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:33,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 21:33:33,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966145729] [2021-01-06 21:33:33,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 21:33:33,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:33,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 21:33:33,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-01-06 21:33:33,465 INFO L87 Difference]: Start difference. First operand 4983 states and 6364 transitions. Second operand 12 states. [2021-01-06 21:33:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:38,202 INFO L93 Difference]: Finished difference Result 10452 states and 13175 transitions. [2021-01-06 21:33:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 21:33:38,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2021-01-06 21:33:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:38,212 INFO L225 Difference]: With dead ends: 10452 [2021-01-06 21:33:38,213 INFO L226 Difference]: Without dead ends: 6872 [2021-01-06 21:33:38,218 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 [2021-01-06 21:33:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6872 states. [2021-01-06 21:33:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6872 to 4255. [2021-01-06 21:33:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4255 states. [2021-01-06 21:33:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5408 transitions. [2021-01-06 21:33:38,364 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5408 transitions. Word has length 128 [2021-01-06 21:33:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:38,364 INFO L481 AbstractCegarLoop]: Abstraction has 4255 states and 5408 transitions. [2021-01-06 21:33:38,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 21:33:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5408 transitions. [2021-01-06 21:33:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 21:33:38,368 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:38,368 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] [2021-01-06 21:33:38,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 21:33:38,368 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash 762294869, now seen corresponding path program 1 times [2021-01-06 21:33:38,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:38,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626689744] [2021-01-06 21:33:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:45,648 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2021-01-06 21:33:45,820 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2021-01-06 21:33:46,016 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2021-01-06 21:33:46,223 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2021-01-06 21:33:46,411 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2021-01-06 21:33:46,769 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2021-01-06 21:33:47,155 WARN L197 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2021-01-06 21:33:47,404 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2021-01-06 21:33:47,665 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-01-06 21:33:47,883 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-01-06 21:33:48,060 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2021-01-06 21:33:48,220 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2021-01-06 21:33:48,393 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-01-06 21:33:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:33:48,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626689744] [2021-01-06 21:33:48,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:48,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-01-06 21:33:48,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449022177] [2021-01-06 21:33:48,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 21:33:48,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 21:33:48,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-01-06 21:33:48,671 INFO L87 Difference]: Start difference. First operand 4255 states and 5408 transitions. Second operand 16 states. [2021-01-06 21:33:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:59,357 INFO L93 Difference]: Finished difference Result 8469 states and 10762 transitions. [2021-01-06 21:33:59,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 21:33:59,359 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2021-01-06 21:33:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:59,365 INFO L225 Difference]: With dead ends: 8469 [2021-01-06 21:33:59,366 INFO L226 Difference]: Without dead ends: 7043 [2021-01-06 21:33:59,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2021-01-06 21:33:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7043 states. [2021-01-06 21:33:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7043 to 4295. [2021-01-06 21:33:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4295 states. [2021-01-06 21:33:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 5452 transitions. [2021-01-06 21:33:59,597 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 5452 transitions. Word has length 129 [2021-01-06 21:33:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:59,597 INFO L481 AbstractCegarLoop]: Abstraction has 4295 states and 5452 transitions. [2021-01-06 21:33:59,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 21:33:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 5452 transitions. [2021-01-06 21:33:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 21:33:59,602 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:59,603 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] [2021-01-06 21:33:59,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 21:33:59,603 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:59,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:59,604 INFO L82 PathProgramCache]: Analyzing trace with hash 724493226, now seen corresponding path program 1 times [2021-01-06 21:33:59,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:59,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995004723] [2021-01-06 21:33:59,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:34:01,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995004723] [2021-01-06 21:34:01,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:01,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 21:34:01,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266856138] [2021-01-06 21:34:01,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 21:34:01,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:01,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 21:34:01,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:34:01,904 INFO L87 Difference]: Start difference. First operand 4295 states and 5452 transitions. Second operand 7 states. [2021-01-06 21:34:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:04,712 INFO L93 Difference]: Finished difference Result 7100 states and 8995 transitions. [2021-01-06 21:34:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 21:34:04,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2021-01-06 21:34:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:04,717 INFO L225 Difference]: With dead ends: 7100 [2021-01-06 21:34:04,717 INFO L226 Difference]: Without dead ends: 4443 [2021-01-06 21:34:04,720 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:34:04,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2021-01-06 21:34:04,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4093. [2021-01-06 21:34:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4093 states. [2021-01-06 21:34:04,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 5197 transitions. [2021-01-06 21:34:04,898 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 5197 transitions. Word has length 131 [2021-01-06 21:34:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:04,898 INFO L481 AbstractCegarLoop]: Abstraction has 4093 states and 5197 transitions. [2021-01-06 21:34:04,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 21:34:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 5197 transitions. [2021-01-06 21:34:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-06 21:34:04,902 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:04,903 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] [2021-01-06 21:34:04,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 21:34:04,903 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:04,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:04,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1422624458, now seen corresponding path program 1 times [2021-01-06 21:34:04,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:04,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763939335] [2021-01-06 21:34:04,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:34:05,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763939335] [2021-01-06 21:34:05,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:05,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:34:05,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639286765] [2021-01-06 21:34:05,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:34:05,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:05,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:34:05,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:34:05,563 INFO L87 Difference]: Start difference. First operand 4093 states and 5197 transitions. Second operand 5 states. [2021-01-06 21:34:08,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:08,299 INFO L93 Difference]: Finished difference Result 4485 states and 5655 transitions. [2021-01-06 21:34:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:34:08,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2021-01-06 21:34:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:08,306 INFO L225 Difference]: With dead ends: 4485 [2021-01-06 21:34:08,307 INFO L226 Difference]: Without dead ends: 4076 [2021-01-06 21:34:08,309 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 [2021-01-06 21:34:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2021-01-06 21:34:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3974. [2021-01-06 21:34:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3974 states. [2021-01-06 21:34:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5040 transitions. [2021-01-06 21:34:08,449 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5040 transitions. Word has length 135 [2021-01-06 21:34:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:08,449 INFO L481 AbstractCegarLoop]: Abstraction has 3974 states and 5040 transitions. [2021-01-06 21:34:08,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:34:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5040 transitions. [2021-01-06 21:34:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-06 21:34:08,454 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:08,454 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] [2021-01-06 21:34:08,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 21:34:08,454 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:08,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:08,455 INFO L82 PathProgramCache]: Analyzing trace with hash -896033924, now seen corresponding path program 1 times [2021-01-06 21:34:08,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:08,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043025500] [2021-01-06 21:34:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:34:09,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043025500] [2021-01-06 21:34:09,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:09,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:34:09,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327290749] [2021-01-06 21:34:09,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:34:09,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:09,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:34:09,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:34:09,662 INFO L87 Difference]: Start difference. First operand 3974 states and 5040 transitions. Second operand 5 states. [2021-01-06 21:34:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:12,331 INFO L93 Difference]: Finished difference Result 4984 states and 6299 transitions. [2021-01-06 21:34:12,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:34:12,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2021-01-06 21:34:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:12,338 INFO L225 Difference]: With dead ends: 4984 [2021-01-06 21:34:12,338 INFO L226 Difference]: Without dead ends: 3849 [2021-01-06 21:34:12,340 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 [2021-01-06 21:34:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2021-01-06 21:34:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 3745. [2021-01-06 21:34:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3745 states. [2021-01-06 21:34:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3745 states to 3745 states and 4751 transitions. [2021-01-06 21:34:12,472 INFO L78 Accepts]: Start accepts. Automaton has 3745 states and 4751 transitions. Word has length 135 [2021-01-06 21:34:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:12,472 INFO L481 AbstractCegarLoop]: Abstraction has 3745 states and 4751 transitions. [2021-01-06 21:34:12,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:34:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3745 states and 4751 transitions. [2021-01-06 21:34:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-06 21:34:12,477 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:12,477 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] [2021-01-06 21:34:12,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 21:34:12,478 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:12,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2001926345, now seen corresponding path program 1 times [2021-01-06 21:34:12,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:12,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070346736] [2021-01-06 21:34:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:34:14,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070346736] [2021-01-06 21:34:14,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:14,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:34:14,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338569136] [2021-01-06 21:34:14,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:34:14,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:14,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:34:14,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:34:14,088 INFO L87 Difference]: Start difference. First operand 3745 states and 4751 transitions. Second operand 5 states. [2021-01-06 21:34:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:16,555 INFO L93 Difference]: Finished difference Result 5745 states and 7313 transitions. [2021-01-06 21:34:16,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:34:16,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2021-01-06 21:34:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:16,561 INFO L225 Difference]: With dead ends: 5745 [2021-01-06 21:34:16,561 INFO L226 Difference]: Without dead ends: 3584 [2021-01-06 21:34:16,564 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 [2021-01-06 21:34:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2021-01-06 21:34:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3584. [2021-01-06 21:34:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2021-01-06 21:34:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4561 transitions. [2021-01-06 21:34:16,676 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4561 transitions. Word has length 135 [2021-01-06 21:34:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:16,676 INFO L481 AbstractCegarLoop]: Abstraction has 3584 states and 4561 transitions. [2021-01-06 21:34:16,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:34:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4561 transitions. [2021-01-06 21:34:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-01-06 21:34:16,680 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:16,680 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] [2021-01-06 21:34:16,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 21:34:16,680 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:16,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1922740211, now seen corresponding path program 1 times [2021-01-06 21:34:16,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:16,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204449122] [2021-01-06 21:34:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:34:18,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204449122] [2021-01-06 21:34:18,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:18,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:34:18,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561930317] [2021-01-06 21:34:18,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:34:18,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:18,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:34:18,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:34:18,708 INFO L87 Difference]: Start difference. First operand 3584 states and 4561 transitions. Second operand 10 states. [2021-01-06 21:34:22,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:22,803 INFO L93 Difference]: Finished difference Result 7756 states and 9846 transitions. [2021-01-06 21:34:22,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 21:34:22,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 136 [2021-01-06 21:34:22,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:22,810 INFO L225 Difference]: With dead ends: 7756 [2021-01-06 21:34:22,810 INFO L226 Difference]: Without dead ends: 4982 [2021-01-06 21:34:22,815 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 [2021-01-06 21:34:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4982 states. [2021-01-06 21:34:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4982 to 3240. [2021-01-06 21:34:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3240 states. [2021-01-06 21:34:22,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 4126 transitions. [2021-01-06 21:34:22,997 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 4126 transitions. Word has length 136 [2021-01-06 21:34:22,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:22,997 INFO L481 AbstractCegarLoop]: Abstraction has 3240 states and 4126 transitions. [2021-01-06 21:34:22,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:34:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 4126 transitions. [2021-01-06 21:34:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-01-06 21:34:23,002 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:23,003 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] [2021-01-06 21:34:23,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 21:34:23,003 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:23,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:23,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1360392325, now seen corresponding path program 1 times [2021-01-06 21:34:23,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:23,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225196286] [2021-01-06 21:34:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:34:24,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225196286] [2021-01-06 21:34:24,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:24,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:34:24,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318342709] [2021-01-06 21:34:24,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 21:34:24,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:24,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 21:34:24,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-01-06 21:34:24,559 INFO L87 Difference]: Start difference. First operand 3240 states and 4126 transitions. Second operand 11 states. [2021-01-06 21:34:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:28,282 INFO L93 Difference]: Finished difference Result 5922 states and 7433 transitions. [2021-01-06 21:34:28,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 21:34:28,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2021-01-06 21:34:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:28,288 INFO L225 Difference]: With dead ends: 5922 [2021-01-06 21:34:28,288 INFO L226 Difference]: Without dead ends: 3744 [2021-01-06 21:34:28,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-01-06 21:34:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2021-01-06 21:34:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 2512. [2021-01-06 21:34:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2512 states. [2021-01-06 21:34:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 3170 transitions. [2021-01-06 21:34:28,424 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 3170 transitions. Word has length 139 [2021-01-06 21:34:28,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:28,424 INFO L481 AbstractCegarLoop]: Abstraction has 2512 states and 3170 transitions. [2021-01-06 21:34:28,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 21:34:28,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 3170 transitions. [2021-01-06 21:34:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-06 21:34:28,428 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:28,428 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] [2021-01-06 21:34:28,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 21:34:28,429 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash 490526903, now seen corresponding path program 1 times [2021-01-06 21:34:28,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:28,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42674164] [2021-01-06 21:34:28,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:35,765 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2021-01-06 21:34:35,929 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2021-01-06 21:34:36,158 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-01-06 21:34:36,414 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2021-01-06 21:34:36,765 WARN L197 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2021-01-06 21:34:37,140 WARN L197 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2021-01-06 21:34:37,490 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2021-01-06 21:34:37,828 WARN L197 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2021-01-06 21:34:38,304 WARN L197 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 74 [2021-01-06 21:34:38,610 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2021-01-06 21:34:38,838 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2021-01-06 21:34:39,035 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2021-01-06 21:34:39,210 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2021-01-06 21:34:39,370 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2021-01-06 21:34:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-01-06 21:34:39,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42674164] [2021-01-06 21:34:39,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:39,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-06 21:34:39,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461611409] [2021-01-06 21:34:39,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 21:34:39,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:39,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 21:34:39,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:34:39,652 INFO L87 Difference]: Start difference. First operand 2512 states and 3170 transitions. Second operand 17 states. [2021-01-06 21:34:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:49,209 INFO L93 Difference]: Finished difference Result 3260 states and 4079 transitions. [2021-01-06 21:34:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:34:49,210 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 140 [2021-01-06 21:34:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:49,213 INFO L225 Difference]: With dead ends: 3260 [2021-01-06 21:34:49,213 INFO L226 Difference]: Without dead ends: 2841 [2021-01-06 21:34:49,215 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 [2021-01-06 21:34:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2021-01-06 21:34:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2542. [2021-01-06 21:34:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2021-01-06 21:34:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 3203 transitions. [2021-01-06 21:34:49,329 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 3203 transitions. Word has length 140 [2021-01-06 21:34:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:49,330 INFO L481 AbstractCegarLoop]: Abstraction has 2542 states and 3203 transitions. [2021-01-06 21:34:49,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 21:34:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3203 transitions. [2021-01-06 21:34:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-01-06 21:34:49,332 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:49,332 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] [2021-01-06 21:34:49,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 21:34:49,333 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:49,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1529816759, now seen corresponding path program 1 times [2021-01-06 21:34:49,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:49,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118045789] [2021-01-06 21:34:49,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat